Advertisement

Minimal shared information for concurrent reading and writing

  • Prasad Jayanti
  • Adarshpal Sethi
  • Errol L. Lloyd
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 579)

Abstract

While there have been many register construction algorithms in the recent years, results establishing the intrinsic complexity of such constructions are scarce. In this paper, we establish the minimum shared memory necessary to construct an atomic single-writer, single-reader, N-bit register A from single-writer, single-reader, single bit safe registers. The write operation on A is wait-free, but the read operation is not. We also provide constructions that match our lower bounds.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Blo87]
    Bard Bloom. Constructing two writer atomic registers. In The 6th Annual Symposium on Principles of Distributed Computing, pages 249–259, 1987.Google Scholar
  2. [BP87]
    J. Burns and G. Peterson. Constructing multi-reader atomic values from nonatomic values. In The 6th Annual Symposium on Principles of Distributed Computing, pages 222–231, 1987.Google Scholar
  3. [CHP71]
    P.J. Courtois, F. Heymans, and D.L. Parnas. Concurrent control with readers and writers. Communications of the ACM, 14(10):667–668, 1971.Google Scholar
  4. [CW90]
    Soma Chaudhuri and Jennifer Welch. Bounds on the costs of register implementations. Technical report, University of North Carolina at Chapel Hill, Dept. of Computer Science, Univ. of North Carolina at Chapel Hill, Chapel Hill, NC 27599–3175, 1990.Google Scholar
  5. [Jay91]
    Prasad Jayanti. Optimal atomic register (in preparation). Technical report, Cornell University, Dept. of Computer Science, Cornell University, Ithaca, NY 14853, 1991.Google Scholar
  6. [JSL90]
    Prasad Jayanti, Adarshpal Sethi, and Errol Lloyd. Minimal shared information for concurrent reading and writing. Technical report, University of Delaware, Dept. of Computer and Information Sciences, University of Del aware, Newark, DE 19716, 1990.Google Scholar
  7. [Lam77]
    Leslie Lamport. Concurrent reading and writing. Communications of the ACM, 20(11):806–811, 1977.Google Scholar
  8. [Lam86]
    Leslie Lamport. On interprocess communication, parts i and ii. Distributed Computing, 1:77–101, 1986.Google Scholar
  9. [Lyn89]
    Nancy A. Lynch. A hundred impossibility proofs for distributed computing. In The 8th Annual Symposium on Principles of Distributed Computing, pages 1–27, 1989.Google Scholar
  10. [NW87]
    R. Newman-Wolf. A protocol for wait-free, atomic, multi-reader shared variables. In The 6th Annual Symposium on Principles of Distributed Computing, pages 232–248, 1987.Google Scholar
  11. [PB87]
    G. Peterson and J. Burns. Concurrent reading while writing ii: the multi-writer case. In The 28th Annual Symposium on Foundations of Computer Science, 1987.Google Scholar
  12. [Pet83]
    Gary L. Peterson. Concurrent reading while writing. ACM TOPLAS, 5(1):56–65, 1983.Google Scholar
  13. [SAG87]
    A. Singh, J. Anderson, and M. Gouda. The elusive atomic register, revisited. In The 6th Annual Symposium on Principles of Distributed Computing, pages 206–221, 1987.Google Scholar
  14. [Sch88]
    R. Schaffer. On the correctness of atomic multi-writer registers. Technical report, TR No: MIT/LCS/TM-364, MIT Laboratory for Computer Science, 1988.Google Scholar
  15. [Tro89]
    J.T. Tromp. How to construct an atomic variable. Technical report, Centrum Voor Wiskunde en Informatica, 1989.Google Scholar
  16. [VA86]
    P. Vitanyi and B. Awerbuch. Atomic shared register access by asynchronous hardware. In The 27th Annual Symposium on Foundations of Computer Science, 1986.Google Scholar
  17. [Vid88]
    K. Vidyasankar. Converting lamport's regular register to atomic register. IPL, 28:287–290, 1988.Google Scholar
  18. [Vid89]
    K. Vidyasankar. An elegant 1-writer multireader multivalued atomic register. IPL, 30:221–223, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Prasad Jayanti
    • 1
  • Adarshpal Sethi
    • 2
  • Errol L. Lloyd
    • 2
  1. 1.Department of Computer ScienceCornell UniversityIthaca
  2. 2.Department of Computer ScienceUniversity of DelawareNewark

Personalised recommendations