BG Distributed Simulation Algorithm
Publisher
Springer New York
Reference19 articles.
1. Afek Y, Attiya H, Dolev D, Gafni E, Merritt M, Shavit N (1993) Atomic snapshots of shared memory. J ACM 40(4):873–890
2. Attiya H (2006) Adapting to point contention with long-lived safe agreement. In: Proceedings of the 13th international conference on structural information and communication complexity, SIROCCO’06, Chester. Springer, Berlin/Heidelberg, pp 10–23
3. Borowsky E, Gafni E (1993) Generalized FLP impossibility result for t-resilient asynchronous computations. In: STOC ’93: proceedings of the twenty-fifth annual ACM symposium on theory of computing, San Diego. ACM, New York, pp 91–100
4. Borowsky E, Gafni E, Lynch N, Rajsbaum S (2001) The BG distributed simulation algorithm. Distrib Comput 14(3):127–146
5. Chandra T, Hadzilacos V, Jayanti P, Toueg S (1994) Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract). In: PODC ’94: proceedings of the thirteenth annual ACM symposium on principles of distributed computing, Los Angeles. ACM, New York, pp 334–343