The BG distributed simulation algorithm

Distributed Computing

Volumn 14, Issue 3, 2001, Pages 127-146

  Borowsky, E ^a   Gafni, E ^b   Lynch, N ^c   Rajsbaum, S ^d  

^a BOSTON COLLEGE   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

Author keywords

Consensus; Distributed computing; Fault tolerance; Set agreement; Simulation

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; COMPUTER SYSTEM RECOVERY; FAULT TOLERANT COMPUTER SYSTEMS; LARGE SCALE SYSTEMS; PROBLEM SOLVING;

DISTRIBUTED SIMULATION; MULTITRY SNAPSHOT STRATEGY; SET AGREEMENT PROBLEM; SHARED MEMORY ALGORITHM;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0035390412     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00008933     Document Type: Article

References (26)

1. Atomic snapshots of shared memory
2. Renaming in an asynchronous environment
3. Synchronization power depends on the register size, (preliminary version)
4. A combinatorial characterization of the distributed 1-solvable tasks
5. Generalized FLP impossibility result for t-resilient asynchronous computations
6. The implication of the Borowsky-Gafni simulation on the set consensus hierarchy
7. Capturing the power of resiliency and set consensus in distributed systems
8. More choices allow more faults: Set consensus problems in totally asynchronous systems
9. Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies
10. Understanding the set consensus partial order using the Borowsky-Gafni simulation
11. Impossibility of distributed consensus with one faulty process
12. 3-processor tasks are undecidable
13. Wait-free synchronization
14. Set consensus using arbitrary objects
15. A primer on algebraic topology and distributed computing
16. On the decidability of distributed decision tasks
17. On the existence of booster types
18. The asynchronous computability theorem for t-resilient tasks
19. Memory requirements for agreement among unreliable asynchronous processes
20. On the power of shared object types to implement one-resilient consensus
21. On the Borowsky-Gafni simulation algorithm
22. An introduction to input/output automata
23. Forward and backward simulations - Part I: Untimed systems
24. Understanding the set consensus partial order using the Borowsky-Gafni simulation
25. Wait-free k-set agreement is impossible: The topology of public knowledge