Skip to main content
SpringerLink
Log in

Atomicm-register operations

  • Published:
Distributed Computing Aims and scope Submit manuscript

Summary

We investigate systems where it is possible to access several shared registers in one atomic step. 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 atomicm-register operations.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Afek Y, Attiya H, Dolev D, Gafni M, Merritt M, Shavit N: Atomic snapshots. In: Proc of the 9th Annual ACM Symp on Principles of Distributed Computing, pp 1–13, August 1990 (to appear in J ACM)

  2. Anderson JH: Composite registers. Tech Rep TR-89-25, Department of Computer Science, The University of Texas at Austin, September 1989

  3. Anderson JH: Multiple-writer composite registers. Tech Rep TR-89-26, Department of Computer Science, The University of Texas at Austin, September 1989

  4. Bloom B: Constructing two-writer atomic registers. In: Proc 6th ACM Symp on Principles of Distributed Computing, pp 249–259, 1987.

  5. Burns JE, Lynch AN: Bounds on shared memory for mutual exclusion. Inf Comput (to appear.) An early version appeared in the Proceedings of 18th Annual Allerton Conference on Communication, Control and Computing, 1980, pp 833–842

  6. Chandy KM, Misra J: Parallel program design: a foundation. Addison-Wesley, 1988

  7. Chaudhuri S: More choices allow more faults: set consensus problems in totally asynchronous systems. Inf Comput 105(1): 132–158 (1993)

    Google Scholar 

  8. Chor B, Israeli A, Li M: On processor coordination using asynchronous hardware. In: Proc 6th ACM Symp on Principles of Distributed Computing, pp 86–97, 1987

  9. Cole R, Zajicek O: The APRAM: Incorporating asynchrony into the PRAM model In: Proc of the 1989 ACM Symp on Parallel algorithms and Architectures, pp 169–178, June 1989

  10. Fischer MJ, Lynch NA, Paterson MS: Impossibility of distributed consensus with one faulty process. J ACM 32(2): 374–382 (1985)

    Google Scholar 

  11. Herlihy M: Wait-free synchronization. ACM Trans Program Lang Syst 11(1): 124–149 (1991)

    Google Scholar 

  12. Lamport L: On interprocess communication, parts I and II. Distrib Comput 1(2): 77–101 (1986)

    Google Scholar 

  13. Lamport L: A fast mutual exclusion algorithm. ACM Trans Comput Syst 5(1): 1–11 (1987)

    Google Scholar 

  14. Loui MC, Abu-Amara H: Memory requirements for agreement among unreliable asynchronous processes. Adv Comput Res 4: 163–183 (1987)

    Google Scholar 

  15. Peterson GL, Burns JE: Concurrent reading while writing ii: the multiwriter case. In: Proc 28th IEEE Symp on Foundations of Computer Science, pp 383–392, 1987

  16. Peterson GL, Fischer MJ: Economical solutions for the critical section problem in a distributed system. In: Proc 9th ACM Symp on Theory of Computing, pp 91–97, 1977

  17. Taubenfeld G: On the nonexistence of resilient consensus protocols. Inf Process Lett 37: 285–289 (1991)

    Google Scholar 

  18. Taubenfeld G, Moran S: Possibility and impossibility results in a shared memory environment. In: 3rd International Workshop on Distributed Algorithms. In: Bermond JC, Raynal M, (eds) Lect Notes Comput Sci vol 392. Springer 1989, pp 254–267

  19. Vitanyi PMB, Awerbuch B: Atomic shared register access by asynchronous hardware. In: Proc 27th IEEE Symp on Foundations of Computer Science, pp 223–243, 1986 Errata, Ibid. Vitanyi PMB, Awerbuch B: Atomic shared register access by asynchronous hardware. In: Proc 27th IEEE Symp on Foundations of Computer Science, pp 223–243, 1987

Download references

Author information

Authors and Affiliations

  1. AT&T Bell Laboratories, 600 Mountain Avenue, 07974, Murray Hill, NJ, USA

    Michael Merritt & Gadi Taubenfeld

Authors
  1. Michael Merritt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gadi Taubenfeld
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Michael Merritt received a B.S. degree in Philosophy and in Computer Science from Yale College in 1978, the M.S. and Ph. D. degrees in Information and Computer Science in 1980 and 1983, respectively, from the Georgia Institute of Technology. Since 1983 he has been a member of technical staff at AT&T Bell Laboratories, and has taught as an adjunct or visiting lecturer at Stevens Institute of Technology and Columbia University. In 1989 he was program chair for the ACM Symposium on Principles of Distributed Computing. His research interests include distributed and concurrent computation, both algorithms and formal methods for verifying their correctness, cryptography, and security. He is an editor for Distributed Computing and for Information and Computation, recently coauthored a book on database concurrency control algorithms, and is a member of the ACM and of Computer Professionals for Social Responsibility.

Gadi Taubenfeld received the B.A., M.Sc. and Ph.D. degrees in Computer Science from the Technion (Israel Institute of Technology), in 1982, 1984 and 1988, respectively. From 1988 to 1990 he was a research scientist at Yale University. Since 1991 he has been a member of technical staff at AT&T Bell Laboratories. His primary research interests are in concurrent and distributed computing.

A preliminary version of this workappeared in theProceedings of the Fifth International Workshop on Distributed Algorithms, Delphi, Greece, October 1991, pp 289–294

Rights and permissions

Reprints and permissions

About this article

Cite this article

Merritt, M., Taubenfeld, G. Atomicm-register operations. Distrib Comput 7, 213–221 (1994). https://doi.org/10.1007/BF02280835

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02280835

Key words

Search

Navigation