Random generation of combinatorial structures from a uniform
Theoretical Computer Science
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
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
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
"Go with the winners" algorithms
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Randomized Shared Queues Applied to Distributed Optimization Algorithms
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Go with the Winners Algorithms for Cliques in Random Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
| Hi-index | 0.00 |
We parallelize the 'Go with the winners' algorithm of Aldous and Vazirani 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, we analyze our algorithm for a concrete application: generating models of amorphous chemical structures.