Wait-Free Universality of Consensus in the Infinite Arrival Model (original) (raw)
Related papers
Brief Announcement: Wait-Free Universality of Consensus in the Infinite Arrival Model
Leibniz-Zentrum für Informatik (Schloss Dagstuhl), 2019
What Can Be Done with Consensus Number One: Relaxed Queues and Stacks
ArXiv, 2020
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Achour Mostefaoui, Sergio Rajsbaum
Journal of the ACM, 2003
N-Consensus is the Second Strongest Object for N + 1 Processes
Lecture Notes in Computer Science, 2007
Wait-free linearizable queue implementations
2004
Consensus in anonymous asynchronous systems with crash-recovery and omission failures
Computing, 2021
Extending the Wait-free Hierarchy to Multi-Threaded Systems
Proceedings of the 39th Symposium on Principles of Distributed Computing, 2020
Distributed Consensus, revisited
Acta Informatica, 2007
Common2 extended to stacks and unbounded concurrency
Distributed Computing, 2007
Nontrivial and universal helping for wait-free queues and stacks
Journal of Parallel and Distributed Computing, 2018
An Efficient Universal Construction for Message-Passing Systems
2002
Simple CHT: A new derivation of the weakest failure detector for consensus
Consensus in Asynchronous Distributed Systems: A Concise Guided Tour
Lecture Notes in Computer Science, 2000
The concurrency hierarchy, and algorithms for unbounded concurrency
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, 2001
A Simple Object that Spans the Whole Consensus Hierarchy
arXiv (Cornell University), 2018
Brief Announcement: Revisiting Consensus Protocols through Wait-Free Parallelization
2019
Implementation of a wait-free synchronization primitive that solves n-process consensus
Information Processing Letters, 1989
Revisiting consensus protocols through wait-free parallelization
2019
Initial failures in distributed computations
International Journal of Parallel Programming, 1989
Byzantine Consensus In Asynchronous Message-Passing Systems: a Survey
Algorithms
Universal constructions that ensure disjoint-access parallelism and wait-freedom
2012
Atomic Broadcast In Asynchronous Crash-Recovery Distributed Systems
icdcs, 2000
Sticky bits and universality of consensus
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing - PODC '89
Computing global functions in asynchronous distributed systems with perfect failure detectors
IEEE Transactions on Parallel and Distributed Systems, 2000
Update Consistency for Wait-Free Concurrent Objects
2015 IEEE International Parallel and Distributed Processing Symposium, 2015
With Finite Memory Consensus Is Easier Than Reliable Broadcast
Lecture Notes in Computer Science, 2008
Wait-free Algorithms: the Burden of the Past
Research Square (Research Square), 2024
The gap in circumventing the impossibility of consensus
Journal of Computer and System Sciences, 2008
A Wealth of Sub-Consensus Deterministic Objects
2018
A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97, 1997
The unified structure of consensus
Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98, 1998
Eventual leader election in infinite arrival message-passing system model with bounded concurrency
2010
One-Step Consensus Solvability
Lecture Notes in Computer Science, 2006
Algorithmica, 2010