Parallel 'go with the winners' algorithms in distributed memory models

Authors:
Marcus Peinado;Thomas Lengauer
Affiliations:
Microsoft, Redmond, WA;Max Planck Institute for Computer Science, 66123 Saarbrücken, Germany
Venue:
Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
Year:
2003

Citing 12
Cited 0

Random generation of combinatorial structures from a uniform

Theoretical Computer Science
Approximating the permanent

SIAM Journal on Computing
A bridging model for parallel computation

Communications of the ACM
Designing broadcasting algorithms in the postal model for message-passing systems

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
LogP: towards a realistic model of parallel computation

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Polynomial-time approximation algorithms for the Ising model

SIAM Journal on Computing
LogGP: incorporating long messages into the LogP model—one step closer towards a realistic model for parallel computation

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Testable algorithms for self-avoiding walks

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
`Go with the winners' Generators with Applications to Molecular Modeling

RANDOM '97 Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science
Markov chain algorithms for planar lattice structures

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Models of parallel computation: a survey and synthesis

HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We parallelize the 'go with the winners' algorithm of Aldous and Vazirani (in: Proceedings of the 35th IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Silver Spring., MD, 1994, pp. 492-501) and analyze the resulting parallel algorithm in the LogP-model (in: Proceedings of the Fourth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, 1993, pp. 1-12). 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, we analyze our algorithm for a concrete application: generating models of amorphous chemical structures.