Are wait-free algorithms fast?
From MaRDI portal
Publication:4310843
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
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items
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
