Efficiency of Parallel Genetic Algorithms for Protein Folding on the 2-D HP Model

Eunice E. Santos, Lin Lu, Eugene Santos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In the paper, we study the problem of using parallel genetic algorithms (PGAs) for protein-folding on the 2D HP model. In particular, parallelism introduces additional costs such as communications latencies and bottlenecks that affect performance. We focus on the theoretical analysis of running times for several well-known parallel configurations including master-slave, fine-grained, coarse grained and their variants. From performance data gathered, the theoretical analysis presented has been shown to successfully predict the running times.

Original languageEnglish (US)
Title of host publicationProceedings of the Fifth Joint Conference on Information Sciences, JCIS 2000, Volume 1
EditorsP.P. Wang, P.P. Wang
Pages1094-1097
Number of pages4
Edition1
StatePublished - Dec 1 2000
Externally publishedYes
EventProceedings of the Fifth Joint Conference on Information Sciences, JCIS 2000 - Atlantic City, NJ, United States
Duration: Feb 27 2000Mar 3 2000

Publication series

NameProceedings of the Joint Conference on Information Sciences
Number1
Volume5

Other

OtherProceedings of the Fifth Joint Conference on Information Sciences, JCIS 2000
CountryUnited States
CityAtlantic City, NJ
Period2/27/003/3/00

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Efficiency of Parallel Genetic Algorithms for Protein Folding on the 2-D HP Model'. Together they form a unique fingerprint.

Cite this