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.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Afek, Y., Gafni, E., Rajsbaum, S., Raynal, M., Travers, C.: The k-Simultaneous Consensus Problem. Distributed Computing 22(3), 185–195 (2010)
Anderson, J.: Multi-writer Composite Registers. Distributed Computing 7(4), 175–195 (1994)
Attiya, H., Bar-Noy, A., Dolev, D.: Sharing Memory Robustly in Message Passing Systems. Journal of the ACM 42(1), 121–132 (1995)
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)
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)
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)
Borowsky, E., Gafni, E., Lynch, N., Rajsbaum, S., The, B.G.: Distributed Simulation Algorithm. Distributed Computing 14(3), 127–146 (2001)
Castañeda, A., Rajsbaum, S., Raynal, M.: The Renaming Problem in Shared Memory Systems: an Introduction. Computer Science Review (to appear, 2011)
Chandra, T., Hadzilacos, V., Toueg, S.: The Weakest Failure Detector for Solving Consensus. Journal of the ACM 43(4), 685–722 (1996)
Chaudhuri, S.: More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. Information and Computation 105(1), 132–158 (1993)
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)
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)
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)
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)
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)
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)
Herlihy, M.P.: Wait-Free Synchronization. ACM Transactions on Programming Languages and Systems 13(1), 124–149 (1991)
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)
Herlihy, M.P., Shavit, N.: The Topological Structure of Asynchronous Computability. Journal of the ACM 46(6), 858–923 (1999)
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)
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)
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)
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)
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)
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)
Loui, M.C., Abu-Amara, H.H.: Memory Requirements for Agreement Among Unreliable Asynchronous Processes. Par. and Distributed Computing 4, 163–183 (1987)
Rajsbaum, S., Raynal, M.: Power and Limits of Distributed Computing Shared Memory Models. Tech Report #1974, IRISA, Université de Rennes, France (2011)
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)
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)
Raynal, M.: Failure Detectors for Asynchronous Distributed Systems: an Introduction. Wiley Encyclopdia of Computer Science and Engineering 2, 1181–1191 (2009)
Raynal, M.: Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems, p. 251. Morgan & Claypool Pub. (2010); ISBN 978-1-60845-293-4
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)