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

DOI10.1016/S0743-7315(03)00109-6zbMath1053.68124OpenAlexW2013567836MaRDI QIDQ1414736

Thomas Lengauer, Marcus Peinado

Publication date: 4 December 2003

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0743-7315(03)00109-6

zbMATH Keywords

Parallel algorithmsLoad balancingLogP modelAmorphous solidsGo with the winnersSecond moment methodSelf-avoiding walks

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

This page was built for publication: Parallel `go with the winners' algorithms in distributed memory models.