Randomized k-Set agreement

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2001, Pages 291-297

  Mostefaoui, A ^a   Raynal, M ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

Asynchronous system; Consensus; Fault tolerance; k Set agreement; Randomized protocol

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; NETWORK PROTOCOLS; SET THEORY;

ASYNCHRONOUS SYSTEMS;

PROBLEM SOLVING;

EID: 0034818551     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378580.378690     Document Type: Conference Paper

References (20)

1. Failure detection and randomization: A hybrid approach to solve consensus
2. Another advantage of free choice: Completely asynchronous agreement protocols
3. Generalized FLP impossibility results for t-resilient asynchronous computations
4. Unreliable failure detectors for reliable distributed systems
5. The weakest failure detector for solving consensus
6. Agreement is harder than consensus: Set consensus problems in totally asynchronous systems
7. Impossibility of distributed consensus with one faulty process
8. Reliable broadcast and related problems
9. The asynchronous computability theorem for t-resilient tasks
10. Conditions on input vectors for consensus solvability in asynchronous distributed systems
11. A hierarchy of conditions for consensus solvability
12. Solving consensus using chandra-toueg's unreliable failure detectors: A generic quorum-based approach
13. k-set agreement with limited accuracy failure detectors
14. The best of both worlds: A hybrid approach to solve consensus
15. Randomized byzantine generals
16. Topology-aware algorithms for large scale communication
17. Wait-free k-Set Agreement is impossible: The topology of public knowledge
18. Structured derivations of consensus algorithms for failure detectors