Atomic m-register operations

Extended abstract
  • Michael Merritt
  • Gadi Taubenfeld
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 579)


We investigate systems where it is possible to access several shared registers in one atomic step. Extending proofs in [Her91, LA87], we characterize those systems in which the consensus problem can be solved in the presence of faults and give bounds on the space required. We also describe a fast solution to the mutual exclusion problem using atomic m-register operations.


Shared Memory Critical Section Mutual Exclusion Atomic Step Consensus Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AAD+90]
    Y. Afek, H. Attiya, D. Dolev, M. Gafni, M. Merritt, and N. Shavit. Atomic snapshots. In Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, pages 1–13, August 1990. Submitted for publication.Google Scholar
  2. [ABD+90]
    H. Attiya, A. Bar-Noy, D. Dolev, D. Peleg, and R. Reischuk. Renaming in an asynchronous environment. Journal of the ACM, 37(3):524–548, July 1990.Google Scholar
  3. [BL80]
    J. E. Burns and A. N. Lynch. Mutual exclusion using indivisible reads and writes. In 18th annual allerton conference on communication, control and computing, pages 833–842, 1980.Google Scholar
  4. [Blo87]
    B. Bloom. Constructing two-writer atomic registers. In Proc. 6th ACM Symp. on Principles of Distributed Computing, pages 249–259, 1987.Google Scholar
  5. [CIL87]
    B. Chor, A. Israeli, and M. Li. On processor coordination using asynchronous hardware. In Proc. 6th ACM Symp. on Principles of Distributed Computing, pages 86–97, 1987.Google Scholar
  6. [FLP85]
    M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374–382, April 1985.Google Scholar
  7. [Her91]
    M. Herlihy. Wait-free synchronization. ACM Trans. on Programming Languages and Systems, 11(1):124–149, January 1991.Google Scholar
  8. [LA87]
    C. M. Loui and H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, 4:163–183, 1987.Google Scholar
  9. [Lam86]
    L. Lamport. On interprocess communication, parts I and II. Journal of Distributed Computing, 1(2):77–101, 1986.Google Scholar
  10. [Lam87]
    L. Lamport. A fast mutual exclusion algorithm. ACM Trans. on Computer Systems, 5(1):1–11, 1987.Google Scholar
  11. [PB87]
    G. L. Peterson and J. E. Burns. Concurrent reading while writing ii: the multiwriter case. In Proc. 28th IEEE Symp. on Foundations of Computer Science, pages 383–392, 1987.Google Scholar
  12. [PF77]
    G. L. Peterson and M. J. Fischer. Economical solutions for the critical section problem in a distributed system. In Proc. 9th ACM Symp. on Theory of Computing, pages 91–97, 1977.Google Scholar
  13. [TM89]
    G. Taubenfeld and S. Moran. Possibility and impossibility results in a shared memory environment. In 3rd International Workshop on Distributed Algorithms, 1989. Lecture Notes in Computer Science, vol. 392 (eds.: J.C. Bermond and M. Raynal), Springer-Verlag 1989, pages 254–267.Google Scholar
  14. [VA86]
    P. M. B. Vitanyi and B. Awerbuch. Atomic shared register access by asynchronous hardware. In Proc. 27th IEEE Symp. on Foundations of Computer Science, pages 223–243, 1986. Errata, Ibid., 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Michael Merritt
    • 1
  • Gadi Taubenfeld
    • 1
  1. 1.AT&T Bell LaboratoriesMurray Hill

Personalised recommendations