Conditions on input vectors for consensus solvability in asynchronous distributed systems

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 153-162

  Mostefaoui, A ^a   Rajsbaum, S ^a   Raynal, M ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

Asynchronous systems; Consensus; Fault tolerance

Indexed keywords

ALGORITHMS; FAULT TOLERANT COMPUTER SYSTEMS; VECTORS;

ASYNCHRONOUS DISTRIBUTED SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0034833012     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380792     Document Type: Conference Paper

References (39)

1. Atomic snapshots of shared memory
2. Failure detection and randomization: A hybrid approach to solve consensus
3. Fast deterministic consensus in a noisy environment
4. Efficient and robust sharing of memory in message passing systems
5. Sharing memory robustly in message passing systems
6. Atomic snapshots in O(n log n) operations
7. Efficient asynchronous consensus with the weak adversary scheduler
8. Another advantage of free choice: Completely asynchronous agreement protocols
9. Deciding 1-solvability of distributed tasks is NP-hard
10. A combinatorial characterization of the distributed 1-solvable tasks
11. The BG distributed simulation algorithm
12. Asynchronous consensus and broadcast protocols
13. Unreliable failure detectors for reliable distributed systems
14. More choices allow more faults: Set consensus problems in totally asynchronous systems
15. On the minimal synchronism needed for distributed consensus
16. Reaching approximate agreement in the presence of faults
17. Consensus in the presence of partial synchrony
18. Impossibility of distributed consensus with one faulty process
19. Distributed computing: A glimmer of a theory
20. Three-processor tasks are undecidable
21. Reliable broadcast and related problems
22. Wait-free synchronization
23. On the decidability of distributed decision tasks
24. New perspectives in distributed computing
25. Linearizability: A correctness condition for concurrent objects
26. Fault-tolerant wait-free shared objects
27. The part-time parliament
28. Memory requirements for agreement among unreliable asynchronous processes
29. A hundred impossibility proofs for distributed computing
30. Extended impossibility results for asynchronous complete networks
31. The unified structure of consensus: A layered analysis approach
32. A hierarchy of conditions for consensus solvability
33. Solving consensus using chandra-toueg's unreliable failure detectors: A general quorum-based approach
34. The best of both worlds: A hybrid approach to solve consensus
35. Real-time dependable decisions in timed asynchronous distributed systems