Are wait-free algorithms fast?

DOI10.1145/179812.179902zbMath0812.68077OpenAlexW2079344171MaRDI QIDQ4310843

Hagit Attiya, Nir Shavit, Nancy A. Lynch

Publication date: 3 November 1994

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/179812.179902

zbMATH Keywords

time complexityfault-toleranceapproximate agreementwait-free algorithms

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (15)

The time complexity of updating snapshot memories ⋮ Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms ⋮ On self-stabilizing wait-free clock synchronization ⋮ Solo-valency and the cost of coordination ⋮ Lower and upper bounds for single-scanner snapshot implementations ⋮ Linear-time snapshot implementations in unbalanced systems ⋮ Message-optimal protocols for Byzantine Agreement ⋮ The Failure Discovery problem ⋮ Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler ⋮ Hundreds of impossibility results for distributed computing ⋮ Towards a practical snapshot algorithm ⋮ Wait-free approximate agreement on graphs ⋮ Wait-free approximate agreement on graphs ⋮ Timing conditions for linearizability in uniform counting networks ⋮ Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity

This page was built for publication: Are wait-free algorithms fast?