Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Algorithms pp 1–6Cite as

BG Distributed Simulation Algorithm

  • Living reference work entry
  • First Online:

  • 208 Accesses

Years and Authors of Summarized Original Work

1993; Borowsky, Gafni2001; Borowsky, Gafni, Lynch, Rajsbaum

Problem Definition

How to effectively translate an algorithm from a distributed system model to another one?

Distributed systems come in diverse settings that are modeled by different assumptions (1) on the way processes communicate, e.g., using shared memory or messages, (2) on the fault model, (3) on synchrony assumptions, etc. Each of these parameters has a dramatic impact on the computing power of the model, and in practice, an algorithm or an impossibility result is usually tailored to a particular model and cannot be directly reused in another model.

This wide variety of models has given rise to many different impossibility theorems and numerous algorithms for many of the possible combinations of parameters that characterize them. Thus, a crucial question is the following: are there bridges between some models, i.e., is it possible to transfer an impossibility result or an...

This is a preview of subscription content, log in via an institution.

Recommended Reading

  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

    Article  MATH  Google Scholar 

  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

    Google Scholar 

  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

    Google Scholar 

  4. Borowsky E, Gafni E, Lynch N, Rajsbaum S (2001) The BG distributed simulation algorithm. Distrib Comput 14(3):127–146

    Article  Google Scholar 

  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

    Google Scholar 

  6. Chaudhuri S (1993) More choices allow more faults: set consensus problems in totally asynchronous systems. Inf Comput 105(1):132–158

    Article  MATH  Google Scholar 

  7. Chaudhuri S, Reiners P (1996) Understanding the set consensus partial order using the Borowsky-Gafni simulation (extended abstract). In: Proceedings of the 10th international workshop on distributed algorithms, Bologna. Springer, London, pp 362–379

    Google Scholar 

  8. Gafni E (2009) The extended BG-simulation and the characterization of t-resiliency. In: Proceedings of the 41st annual ACM symposium on theory of computing, STOC ’09, Bethesda. ACM, New York, pp 85–92

    Google Scholar 

  9. Gafni E, Kuznetsov P (2011) On set consensus numbers. Distrib Comput 23(3–4):149–163

    Article  Google Scholar 

  10. Herlihy M (1991) Wait-free synchronization. ACM Trans Program Lang Syst 13(1):124–149

    Article  Google Scholar 

  11. Herlihy M, Kozlov D, Rajsbaum S (2013) Distributed Computing Through Combinatorial Topology. Morgan Kaufmann, Amsterdam

    Google Scholar 

  12. Herlihy M, Rajsbaum S (1997) The decidability of distributed decision tasks (extended abstract). In: Proceedings of the twenty-ninth annual ACM symposium on theory of computing, STOC ’97, El Paso. ACM, New York, pp 589–598

    Google Scholar 

  13. Herlihy M, Shavit N (1999) The topological structure of asynchronous computability. J ACM 46(6):858–923

    Article  MathSciNet  MATH  Google Scholar 

  14. Imbs D, Raynal M (2009) Visiting gafni’s reduction land: from the BG simulation to the extended BG simulation. In: SSS, pp 369–383

    Google Scholar 

  15. Imbs D, Raynal M (2010) The multiplicative power of consensus numbers. In: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on principles of distributed computing, PODC ’10, Zurich. ACM, New York, pp 26–35

    Google Scholar 

  16. Kuznetsov P (2013) Universal model simulation: BG and extended BG as examples. In: SSS, pp 17–31

    Google Scholar 

  17. Lynch NA (1996) Distributed algorithms. Morgan Kaufmann Publishers Inc., San Francisco

    MATH  Google Scholar 

  18. Lynch N, Rajsbaum S (1996) On the Borowsky-Gafni simulation algorithm. In: Proceedings of the fourth Israel symposium on theory of computing and systems, ISTCS ’96, Jerusalem. IEEE Computer Society, pp 4–15

    Google Scholar 

  19. Saks M, Zaharoglou F (2000) Wait-free k-set agreement is impossible: the topology of public knowledge. SIAM J Comput 29(5):1449–1483

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of Analysis and Architecture of Systems (LAAS); Centre National de la Recherche Scientifique (CNRS), Université Toulouse, Toulouse, France

    Matthieu Roy

Authors
  1. Matthieu Roy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Matthieu Roy .

Editor information

Editors and Affiliations

  1. Dept. Electrical Engineering & Computer Science, Northwestern University, Evanston, Illinois, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer Science+Business Media New York

About this entry

Cite this entry

Roy, M. (2015). BG Distributed Simulation Algorithm. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27848-8_611-1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27848-8_611-1

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Online ISBN: 978-3-642-27848-8

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation