DocumentCode
309161
Title
Parallel `Go with the winners´ algorithms in the LogP model
Author
Peinado, Marcus ; Lengauer, Thomas
Author_Institution
German Nat. Res. Center for Comput. Sci., St. Augustin, Germany
fYear
1997
fDate
1-5 Apr 1997
Firstpage
656
Lastpage
664
Abstract
The authors parallelize the `Go with the winners´ algorithm of Aldous and Vazirani (1994) and analyze the resulting parallel algorithm in the LogP-model. The main issues in the analysis are load imbalances and communication delays. The result of the analysis is a practical algorithm which, under reasonable assumptions, achieves linear speedup. Finally, they analyze the algorithm for a concrete application: generating models of amorphous chemical structures
Keywords
Monte Carlo methods; chemical structure; chemistry computing; delays; optimisation; parallel algorithms; resource allocation; LogP model; amorphous chemical structure model generation; communication delays; linear speedup; load imbalances; parallel algorithm; parallelized Go with the winners algorithm; Algorithm design and analysis; Approximation algorithms; Chemical analysis; Concrete; Delay; Information technology; Monte Carlo methods; Polynomials; Scientific computing; Simulated annealing;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing Symposium, 1997. Proceedings., 11th International
Conference_Location
Genva
ISSN
1063-7133
Print_ISBN
0-8186-7793-7
Type
conf
DOI
10.1109/IPPS.1997.580972
Filename
580972
Link To Document