Advertisement

Sharing memory in asynchronous message passing systems

  • Oscar R. Aguilar
  • Ajoy Kumar Datta
  • Sukumar Ghosh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 519)

Abstract

We present an algorithm to simulate Read-Modify-Write registers in a message passing system with unreliable asynchronous processors and asynchronous communication. The algorithm works correctly in the presence of a strong adversary that can stop up to T processors, or stop the delivery of their messages where T=[N/2]−1 and N is the number of processors in the system. This is the best resilience that can be achieved in the message passing systems. The high resilience of the algorithm is obtained by using randomized consensus algorithms and a robust communication primitive. The use of this primitive allows a processor to exchange local information with a majority of processors in a consistent way and therefore, make decisions safely. The simulator makes it possible to translate algorithms for the shared memory model to that for the message passing model. With some minor modifications the algorithm can be used to robustly simulate shared queues, shared stacks, etc.

Key words

Atomicity asynchronous systems consensus message passing model mutual exclusion randomized algorithms resiliense shared memory model synchronization primitives Read-Modify-Write registers 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6 References

  1. [1]
    H. Attiya, A. Bar-Noy, and D. Dolev, Sharing Memory Robustly in Message passing systems. Proc. Ninth Annual ACM Symp. on Principles of Distributed Computing, Quebec City, Montreal, August 1990, 363–375.Google Scholar
  2. [2]
    A. Bar-Noy and D. Dolev, Shared Memory vs. Message-Passing in an Asynchronous Distributed environment. Proc. Eighth Annual ACM Symp. on Principles of Distributed Computing, Edmonton, Alberta, August 1989, 307–318.Google Scholar
  3. [3]
    B. Bloom, Constructing Two Writer Atomic Register. Proc. Sixth Annual ACM Symp. on Principles of Distributed Computing, Vancouver, B.C., August 1987, 249–259.Google Scholar
  4. [4]
    J. Burns and G. Peterson, Constructing Multireader Atomic Values from Non Atomic Values. Proc. Sixth Annual ACM Symp. on Principles of Distributed Computing, Vancouver, B.C., August 1987, 222–231.Google Scholar
  5. [5]
    J. Burns and G. Peterson, Concurrent Reading while Writing II: The Multiwriter Case. TR GIT-ICS-86/26, School of Information and Computer Science, Georgia Tech., December 1986.Google Scholar
  6. [6]
    B. Chor and L. Moscovici, Solvability in Asynchronous Environments, 30th Annual Symp. on Foundations of Computer Science, Research Triangle Park, North Carolina, Oct/Nov 1989, 422–427.Google Scholar
  7. [7]
    D. Dolev, C. Dwork, and L. Stockmeyer, On the Minimal Synchronism Needed for Distributed Consensus. Journal of the ACM, Vol 34, No 1, January 1987, 77–97.Google Scholar
  8. [8]
    M. Fisher, N. Lynch, and M. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, Vol 32, No. 2, April 1985, 374–382.Google Scholar
  9. [9]
    A. Gottlieb, R. Grishman, C. Krustal, K. McAuliffe, L. Rudolph, and M. Snir. The NYU Ultracomputer-Designing an MIMD parallel computer. IEEE Transactions on Computers, Vol 32, No. 2, Feb. 1984, 175–189.Google Scholar
  10. [10]
    C.P. Kruskal, L. Rudolph, and M. Snir, Efficient Synchronization on Multiprocessors with Shared Memory. Proc. Fifth Annual ACM Symp. on Principles of Distributed Computing, Vancouver, B.C., August 1986, 218–227.Google Scholar
  11. [11]
    M. Herlihy, Impossibility and Universality Results for Wait-Free Synchronization. Proc. Seventh Annual ACM Symp. on Principles of Distributed Computing, Vancouver, B.C., August 1988, 276–290.Google Scholar
  12. [12]
    M. Herlihy and J. Wing. Axioms for Concurrent Systems. Proc. 14th ACM Symp. on Principles of Programming Languages, Jan 1987, pp 13–26.Google Scholar
  13. [13]
    L. Lamport, On Interprocess Communication Part I and II. Distributed Computing, Vol 1, 77–101, 1986.Google Scholar
  14. [14]
    R. Newmann-Wolfe, A Protocol for Wait-Free, Atomic Multireader Shared Variables. Proc. Sixth Annual ACM Symp. on Principles of Distributed Computing, Vancouver, B.C., August 1987, 232–247.Google Scholar
  15. [15]
    G. Peterson, Concurrent Reading while Writing. ACM Transactions on Programming Languages and Systems, Vol 5, No 1, January 1983, 46–55.Google Scholar
  16. [16]
    S. Plotkin, Sticky Bits and the Universality of Consensus. Proc. Eighth Annual ACM Symp. on Principles of Distributed Computing, Edmonton, Alberta, August 1989, 159–175.Google Scholar
  17. [17]
    A. Singh, J. Anderson, and M. Gouda, The Elusive Atomic Register. Technical Report TR 86.29, Department of Computer Science, University of Texas at Austin, December 1986.Google Scholar
  18. [18]
    A. Singh, J. Anderson, and M. Gouda, The Elusive Atomic Register Revisited. Technical Report TR 86.30, Department of Computer Science, University of Texas at Austin, December 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Oscar R. Aguilar
    • 1
  • Ajoy Kumar Datta
    • 1
  • Sukumar Ghosh
    • 2
  1. 1.University of NevadaLas Vegas
  2. 2.University of IowaIowa City

Personalised recommendations