Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Distributed Algorithms

WDAG 1996: Distributed Algorithms pp 56–70Cite as

Efficient and robust sharing of memory in message-passing systems

Extended abstract

  • Regular Papers
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1151))

Abstract

An emulation of a wait-free, atomic, single-writer multi-reader register in an asynchronous message passing system is presented. The emulation can withstand the failure of up to half of the processors, and requires O(n) messages (for each read or write operation), assuming there are n+1 processors in the system. It improves on the previous emulation, which required O(n 2) messages (for each read or write operation). The message complexity of the new emulation is within a constant factor of the optimum.

The new emulation implies improved algorithms to solve the following problems in the message-passing model in the presence of processor failures: multi-writer multi-reader registers, concurrent time-stamp systems, ℓ-exclusion, atomic snapshots, randomized consensus, implementation of data structures, as well as improved fault-tolerant algorithms for any solvable decision task.

This research was partially supported by grant No. 92-0233 from the United States-Israel Binational Science Foundation (BSF), Jerusalem, Israel, Technion V.P.R. funds, and the fund for the promotion of the research at the Technion.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Attiya, A. Bar-Noy, D. Dolev, D. Peleg, and R. Reischuk, Renaming in an Asynchronous Environment, Journal of the ACM, Vol. 37, No. 3 (July 1990), pp. 524–548.

    Article  Google Scholar 

  2. H. Attiya, A. Bar-Noy and D. Dolev, Sharing Memory Robustly in Message-Passing Systems, Journal of the ACM, Vol. 42, No. 1 (1995), pp. 124–142.

    Article  Google Scholar 

  3. B. Awerbuch, Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems, in Proceeding of the 19th ACM Symposium on Theory of Computing, pp. 230–240, 1987.

    Google Scholar 

  4. B. Awerbuch, Y. Mansour, and N. Shavit, Polynomial End-To-End Communication, in Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, pp. 358–363, 1989.

    Google Scholar 

  5. A. Bar-Noy, and D. Dolev, Shared-Memory vs. Message-Passing in an Asynchronous Distributed Environment, Mathematical Systems Theory, Vol. 26 (1993), pp. 21–39.

    Article  Google Scholar 

  6. E. Borowsky and E. Gafni, Generalized FLP Impossibility Result for t-Resilient Asynchronous Computations, in Proceedings of the 1993 ACM Symposium on Theory of Computing, May 1993.

    Google Scholar 

  7. B. Chor, and L. Moscovici, Solvability in Asynchronous Environments, in Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, pp. 422–427, 1989.

    Google Scholar 

  8. D. Dolev, and N. Shavit, unpublished manuscript, July 1987. Appears in [4].

    Google Scholar 

  9. D. Dolev, and N. Shavit, Bounded Concurrent Time-Stamp Systems are Constructible, SIAM Journal on Computing, to appear. Abo: in Proceedings of the 21st ACM Symposium on Theory of Computing, pp. 454–466, 1989.

    Google Scholar 

  10. C. Dwork and O. Waarts, Simple and Efficient Bounded Concurrent Timestamping or: Bounded Concurrent Timestamp Systems are Comprehensible!, in Proceedings of the 24th ACM Symposium on Theory of Computing, pp. 655–666, 1992.

    Google Scholar 

  11. S. Haldar and K. Vidyasankar, Constructing 1-Writer Multireader Multivalued Atomic Variables from Regular Variables, Journal of the ACM, Vol. 42 No. 1 (1995), pp. 186–203.

    Article  Google Scholar 

  12. M.P. Herlihy and S. Rajsbaum, Algebraic Spans, in Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, pages 90–99, August 1995.

    Google Scholar 

  13. M.P. Herlihy and N. Shavit, The Asynchronous Computability Theorem for t-Resilient Tasks, in Proceedings of the 1993 ACM Symposium on Theory of Computing, May 1993.

    Google Scholar 

  14. M.P. Herlihy and N. Shavit, A Simple Constructive Computability Theorem for Wait-Free Computation, in Proceedings of the 1994 ACM Symposium on Theory of Computing, May 1994.

    Google Scholar 

  15. M.P. Herlihy and J.M. Wing, Linearizability: A Correctness Condition for Concurrent Objects, ACM Trans. on Programming Languages and Systems, Vol. 12, No. 3 (1990), pp. 463–492.

    Article  Google Scholar 

  16. A. Israeli, and M. Li, Bounded Time-stamps, Distributed Computing, Vol. 6, No. 4 (1993), pp. 205–209.

    Google Scholar 

  17. L. Lamport, On Interprocess Communication, Parts I and II, Distributed Computing, Vol. 1, No. 1 (1986), pp. 77–101.

    Article  Google Scholar 

  18. N. Lynch and S. Rajsbaum, On the Borowsky-Gafni Simulation, in Proceedings of the 4th Israeli Symposium on Theory of Computing and Systems, (June 1996), pp. 4–15.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The Technion, 32000, Haifa, Israel

    Hagit Attiya

Authors
  1. Hagit Attiya
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Özalp Babaoğlu Keith Marzullo

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Attiya, H. (1996). Efficient and robust sharing of memory in message-passing systems. In: Babaoğlu, Ö., Marzullo, K. (eds) Distributed Algorithms. WDAG 1996. Lecture Notes in Computer Science, vol 1151. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61769-8_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-61769-8_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61769-3

  • Online ISBN: 978-3-540-70679-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation