Parallel ‘go with the winners’ algorithms in distributed memory models

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: Procee...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of parallel and distributed computing Vol. 63; no. 9; pp. 801 - 814
Main Authors:	Peinado, Marcus, Lengauer, Thomas
Format:	Journal Article
Language:	English
Published:	San Diego, CA Elsevier Inc 01.09.2003 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Amorphous solids Applied sciences Computer science; control theory; systems Computer systems and distributed systems. User interface Exact sciences and technology Go with the winners Load balancing LogP model Parallel algorithms Second moment method Self-avoiding walks Software Theoretical computing LogP model Amorphous solids Second moment method Go with the winners Self-avoiding walks Load balancing Parallel algorithms Parallel algorithm Second moment Distributed memory Parallel programming Distributed algorithm Self avoiding walk LogP model: Second moment method Shared memory Algorithm analysis
ISSN:	0743-7315, 1096-0848
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!