Skip to main content
SpringerLink
Log in

A Survey on Some Recent Advances in Shared Memory Models

  • Conference paper
Structural Information and Communication Complexity (SIROCCO 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6796))

  • 683 Accesses

Abstract

Due to the advent of multicore machines, shared memory distributed computing models taking into account asynchrony and process crashes are becoming more and more important. This paper visits models for these systems and analyses their properties from a computability point of view. Among them, the base snapshot model and the iterated model are particularly investigated. The paper visits also several approaches that have been proposed to model failures (mainly the wait-free model and the adversary model) and gives also a look at the BG simulation. The aim of this survey is to help the reader to better understand the power and limits of distributed computing shared memory models.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic Snapshots of Shared Memory. Journal of the ACM 40(4), 873–890 (1993)

    Article  MATH  Google Scholar 

  2. Afek, Y., Gafni, E., Rajsbaum, S., Raynal, M., Travers, C.: The k-Simultaneous Consensus Problem. Distributed Computing 22(3), 185–195 (2010)

    Article  MATH  Google Scholar 

  3. Anderson, J.: Multi-writer Composite Registers. Distributed Computing 7(4), 175–195 (1994)

    Article  Google Scholar 

  4. Attiya, H., Bar-Noy, A., Dolev, D.: Sharing Memory Robustly in Message Passing Systems. Journal of the ACM 42(1), 121–132 (1995)

    Article  MATH  Google Scholar 

  5. Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an Asynchronous Environment. Journal of the ACM 37(3), 524–548 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  6. Borowsky, E., Gafni, E.: Immediate Atomic Snapshots and Fast Renaming. In: Proc. 12th ACM Symposium on Principles of Distributed Computing PODC 193, pp. 41–51 (1993)

    Google Scholar 

  7. Borowsky, E., Gafni, E.: A Simple Algorithmically Reasoned Characterization of Wait-free Computations. In: Proc. 16th ACM Symposium on Principles of Distributed Computing, PODC 1997, pp. 189–198. ACM Press, New York (1997)

    Google Scholar 

  8. Borowsky, E., Gafni, E., Lynch, N., Rajsbaum, S., The, B.G.: Distributed Simulation Algorithm. Distributed Computing 14(3), 127–146 (2001)

    Article  Google Scholar 

  9. Castañeda, A., Rajsbaum, S., Raynal, M.: The Renaming Problem in Shared Memory Systems: an Introduction. Computer Science Review (to appear, 2011)

    Google Scholar 

  10. Chandra, T., Hadzilacos, V., Toueg, S.: The Weakest Failure Detector for Solving Consensus. Journal of the ACM 43(4), 685–722 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  11. Chaudhuri, S.: More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. Information and Computation 105(1), 132–158 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  12. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmann, A.: The Disagreement Power of an Adversary. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 8–21. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  13. Gafni, E.: The 01-Exclusion Families of Tasks. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol. 5401, pp. 246–258. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. Gafni, E., The Extended, B.G.: Simulation and the Characterization of t-Resiliency. In: Proc. 41th ACM Symposium on Theory of Computing (STOC 2009), pp. 85–92. ACM Press, New York (2009)

    Google Scholar 

  15. Gafni, E., Kuznetsov, P.: Turning Adversaries into Friends: Simplified, Made Constructive and Extended. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol. 6490, pp. 380–394. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  16. Gafni, E., Rajsbaum, S.: Recursion in Distributed Computing. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol. 6366, pp. 362–376. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  17. Guerraoui, R., Raynal, M.: From Unreliable Objects to Reliable Objects: the Case of atomic Registers and Consensus. In: Malyshkin, V.E. (ed.) PaCT 2007. LNCS, vol. 4671, pp. 47–61. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  18. Herlihy, M.P.: Wait-Free Synchronization. ACM Transactions on Programming Languages and Systems 13(1), 124–149 (1991)

    Article  Google Scholar 

  19. Herlihy, M.P., Rajsbaum, S.: The Topology of Shared Memory Adversaries. In: Proc. 29th ACM Symposium on Principles of Distributed Computing PODC 2010, pp. 105–113 (2010)

    Google Scholar 

  20. Herlihy, M.P., Shavit, N.: The Topological Structure of Asynchronous Computability. Journal of the ACM 46(6), 858–923 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  21. Herlihy, M.P., Wing, J.L.: Linearizability: a Correctness Condition for Concurrent Objects. ACM Transactions on Programming Languages and Systems 12(3), 463–492 (1990)

    Article  Google Scholar 

  22. Imbs, D., Raynal, M.: Help when Needed, but no More: Efficient Read/Write Partial Snapshot. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 142–156. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  23. Imbs, D., Raynal, M.: Visiting Gafni’s Reduction Land: from the BG Simulation to the Extended BG Simulation. In: Guerraoui, R., Petit, F. (eds.) SSS 2009. LNCS, vol. 5873, pp. 369–383. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  24. Imbs, D., Raynal, M.: The Multiplicative Power of Consensus Numbers. In: Proc. 29th ACM Symp. on Principles of Distributed Computing PODC 2010, pp. 26–35. ACM Press, New York (2010)

    Google Scholar 

  25. Imbs, D., Raynal, M., Taubenfeld, G.: On Asymmetric Progress Conditions. In: Proc. 29th ACM Symp. on Principles of Distributed Computing PODC 2010, pp. 55–64 (2010)

    Google Scholar 

  26. Junqueira, F., Marzullo, K.: Designing Algorithms for Dependent Process Failures. In: Schiper, A., Shvartsman, M.M.A.A., Weatherspoon, H., Zhao, B.Y. (eds.) Future Directions in Distributed Computing. LNCS, vol. 2584, pp. 24–28. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  27. Loui, M.C., Abu-Amara, H.H.: Memory Requirements for Agreement Among Unreliable Asynchronous Processes. Par. and Distributed Computing 4, 163–183 (1987)

    MathSciNet  Google Scholar 

  28. Rajsbaum, S., Raynal, M.: Power and Limits of Distributed Computing Shared Memory Models. Tech Report #1974, IRISA, Université de Rennes, France (2011)

    Google Scholar 

  29. Rajsbaum, S., Raynal, M., Travers, C.: An Impossibility about Failure Detectors in the Iterated Immediate Snapshot Model. Information Processing Letters 108(3), 160–164 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  30. Rajsbaum, S., Raynal, M., Travers, C.: The Iterated Restricted Immediate Snapshot (IRIS) Model. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 487–496. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  31. Raynal, M.: Failure Detectors for Asynchronous Distributed Systems: an Introduction. Wiley Encyclopdia of Computer Science and Engineering 2, 1181–1191 (2009)

    Google Scholar 

  32. Raynal, M.: Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems, p. 251. Morgan & Claypool Pub. (2010); ISBN 978-1-60845-293-4

    Google Scholar 

  33. Taubenfeld, G.: The Computational Structure of Progress Conditions. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 221–235. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instituto de Matemáticas, UNAM, Mexico City, D.F. 04510, Mexico

    Sergio Rajsbaum

  2. Institut Universitaire de France, France

    Michel Raynal

  3. IRISA, Université de Rennes 1, France

    Michel Raynal

Authors
  1. Sergio Rajsbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michel Raynal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. INRIA, Bordeau Sud-Ouest Research Center, 351 cours de la Libération, 33400, Talence cedex, France

    Adrian Kosowski

  2. Department of Computer Science and Communication Engineering, Kyushu University, 744, Motooka, 819-0395, Fukuoka, Japan

    Masafumi Yamashita

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rajsbaum, S., Raynal, M. (2011). A Survey on Some Recent Advances in Shared Memory Models. In: Kosowski, A., Yamashita, M. (eds) Structural Information and Communication Complexity. SIROCCO 2011. Lecture Notes in Computer Science, vol 6796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22212-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22212-2_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22211-5

  • Online ISBN: 978-3-642-22212-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation