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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of parallel and distributed computing Ročník 63; číslo 9; s. 801 - 814
Hlavní autori:	Peinado, Marcus, Lengauer, Thomas
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	San Diego, CA Elsevier Inc 01.09.2003 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!