Wait-free consensus with infinite arrivals

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 524-533

  Aspnes, James ^a   Shah, Gauri ^a   Shah, Jatin ^a  

^a Yale University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; SHIFT REGISTERS;

INFINITE ARRIVALS; WAIT-FREE CONSENSUS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0036040278     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509907.509983     Document Type: Conference Paper

References (25)

1. On achieving consensus using a shared memory
2. Time- and space-efficient randomized consensus
3. Lower bounds for distributed coin-flipping and randomized consensus
4. Fast randomized consensus using shared memory
5. 2 N) operations per processor
6. Adaptive and efficient mutual exclusion
7. Bounded polynomial randomized consensus
8. Are wait-free algorithms fast?
9. Efficient asynchronous consensus with the weak adversary scheduler
10. Efficient asynchronous consensus with the value-oblivious adversary scheduler
11. Cooperative sharing and asynchronous consensus using single-reader single-writer registers
12. Approximated counters and randomized consensus
13. 2 log n) operations
14. On the importance of having an identity or is consensus really universal?
15. Polylog randomized wait-free consensus
16. Wait-free consensus using asynchronous hardware
17. Time-lapse snapshots
18. On the space complexity of randomized synchronization
19. Impossibility of distributed consensus with one faulty process
20. The concurrency hierarchy, and algorithms for unbounded concurrency
21. Wait-free synchronization
22. Memory requirements for agreement among unreliable asynchronous processes
23. Reaching agreements in the presence of faults
24. Optimal time randomized consensus-making resilient algorithms fast in practice