A layered analysis of consensus

SIAM Journal on Computing

Volumn 31, Issue 4, 2002, Pages 989-1021

  Moses, Yoram ^a   Rajsbaum, Sergio ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Consensus; Distributed systems; Impossibility results; Lower bounds; Shaved memory systems; Topology

Indexed keywords

BOUNDARY CONDITIONS; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING; TOPOLOGY;

CONSENSUS; LAYERING; POTENCE CONNECTIVITY;

COMPUTATION THEORY;

EID: 0036520617     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799364006     Document Type: Article

References (36)

1. Atomic snapshots of shared memory
2. A simple bivalency-based proof that t-resilient consensus requires t + 1 rounds
3. Sharing memory robustly in message-passing systems
4. The combinatorial structure of wait-free solvable tasks
5. Complexity of network synchronization
6. A tight lower bound for randomized synchronous consensus
7. A combinatorial characterization of the distributed 1-solvable tasks
8. Tight bounds on the round complexity of distributed 1-solvable tasks
9. Generalized FLP impossibility result for t-resilient asynchronous computations
10. A simple algorithmically reasoned characterization of wait-free computations
11. The BG distributed simulation algorithm
12. Unreliable failure detectors for asynchronous systems
13. Tight bounds for k-set agreement
14. Authenticated algorithms for Byzantine agreement
15. Knowledge and common knowledge in a Byzantine environment: Crash failures
16. A lower bound for the time to assure interactive consistency
17. The consensus problem in unreliable distributed systems (a brief survey)
18. Impossibility of distributed commit with one faulty process
19. Round-by-round fault detectors: Unifying synchrony and asynchrony
20. Wait-free synchronization
21. A primer on algebraic topology and distributed computing
22. Unifying synchronous and asynchronous message-passing models
23. New perspectives in distributed computing (invited lecture)
24. The topological structure of asynchronous computability
25. Towards a topological characterization of asynchronous complexity
26. On the cost of fault-tolerant consensus when there are no faults - A tutorial
27. Memory requirements for agreement among unreliable asynchronous processes
28. Closed schedulers: A novel technique for analyzing asynchronous protocols
29. The unified structure of consensus: A layered analysis approach
30. Reaching agreement in the presence of faults
31. Wait-free k-set agreement is impossible: The topology of public knowledge
32. Time is not a healer
33. Top-down considerations on distributed computing (invited talk)