Fast randomized consensus using shared memory

Journal of Algorithms

Volumn 11, Issue 3, 1990, Pages 441-461

  Aspnes, James ^a   Herlihy, Maurice ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38249017639     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/0196-6774(90)90021-6     Document Type: Article

References (36)

1. On achieving consensus using a shared memory
2. Bounded polynomial randomized consensus
3. Shared memory vs message-passing in an asynchronous distributed enviroment
4. Another advantage of free choice Completely asynchronous agreement protocols
5. Collective coin flipping, robust voting schemes, and minima of banzhaf values
6. Constructing two-writer atomic registers
7. An o(log n) expected rounds randomized byzantine generals algorithm
8. Resilient consensus protocols
9. Flipping coins in many pockets (byzantine agreement on uniformly random values)
10. Constructing multi-reader atomic values from non-atomic values
11. A simple and efficient randomized byzantine agreement algorithm
12. On processor coordination using asynchronous hardware
13. Simple constant-time consensus protocols in realistic failure models
14. Transaction commit in a realistic fault model
15. On the minimal synchronism needed for distributed consensus
16. Consensus in the presence of partial synchrony
17. Flipping persuasively in constant expected time
18. Optimal algorithms for byzantine agreement
19. Impossibility of distributed commit with one faulty process
20. Impossibility and universality results for wait-free synchronization
21. Axioms for concurrent objects
22. Efficient synchronization on multiprocessors with shared memory
23. Concurrent reading and writing
24. On interprocess communication, i, ii
25. Introduction to the Theory of Nested Transactions
26. Hierarchical Correctness Proofs for Distributed Algorithms
27. A protocol for wait-free atomic multi-reader shared variables
28. Concurrent reading while writing
29. Concurrent Reading While Writing II: The Multiwriter Case
30. Randomized byzantine generals
31. The elusive atomic register revisited