Optimal Time–Space Tradeoff for Shared Memory Leader Election

DOI10.1006/jagm.1996.0852zbMath0888.68063OpenAlexW1987370058MaRDI QIDQ4366876

Gideon Stupp, Yehuda Afek

Publication date: 7 January 1998

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1996.0852

zbMATH Keywords

leader electioncomplexity hierarchy for multiprocessor synchronization operations

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Mathematical problems of computer architecture (68M07) Computer system organization (68M99)

Related Items (3)

Solo-valency and the cost of coordination ⋮ Constant-Space Localized Byzantine Consensus ⋮ Hundreds of impossibility results for distributed computing

This page was built for publication: Optimal Time–Space Tradeoff for Shared Memory Leader Election