Advertisement

Some results on the impossibility, universality, and decidability of consensus

  • Prasad Jayanti
  • Sam Toueg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 647)

Keywords

Turing Machine Object Type Concurrent System Consensus Problem Shared Object 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bard Bloom. Constructing two writer atomic registers. In The 6th Annual Symposium on Principles of Distributed Computing, pages 249–259, 1987.Google Scholar
  2. 2.
    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. 3.
    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
  4. 4.
    B. Chor, A. Israeli, and M. Li. On processor coordination using asynchronous hardware. In The 6th ACM Symposium on Principles of Distributed Computing, pages 86–97, August 1987.Google Scholar
  5. 5.
    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
  6. 6.
    Michael Fischer, Nancy Lynch, and Michael Paterson. Impossibility of distributed consensus with one faulty process. JACM, 32(2):374–382, 1985.CrossRefGoogle Scholar
  7. 7.
    M.P. Herlihy. Impossibility and universality results for wait-free synchroniz ation. In The 7th ACM Symposium on Principles of Distributed Computing, 1988.Google Scholar
  8. 8.
    M.P. Herlihy. Wait-free synchronization. ACM TOPLAS, 13(1):124–149, 1991.Google Scholar
  9. 9.
    M.P. Herlihy and J.M. Wing. Linearizability: A correctness condition for concurrent objects. ACM TOPLAS, 12(3):463–492, 1990.Google Scholar
  10. 10.
    Prasad Jayanti, Adarshpal Sethi, and Errol Lloyd. Minimal shared information for concurrent reading and writing. In Workshop on Distributed Algorithms, Delphi, Greece, October 1991. (Will appear in Lecture Notes in Computer Science, Springer-Verlag).Google Scholar
  11. 11.
    Leslie Lamport. Concurrent reading and writing. Communications of the ACM, 20(11):806–811, 1977.Google Scholar
  12. 12.
    Leslie Lamport. On interprocess communication, parts i and ii. Distributed Computing, 1:77–101, 1986.CrossRefGoogle Scholar
  13. 13.
    M.C Loui and Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in computing research, 4:163–183, 1987.Google Scholar
  14. 14.
    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
  15. 15.
    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
  16. 16.
    Gary L. Peterson. Concurrent reading while writing. ACM TOPLAS, 5(1):56–65, 1983.Google Scholar
  17. 17.
    Serge Plotkin. Sticky bits and universality of consensus. In The 8th ACM Symposium on Principles of Distributed Computing, pages 159–175, August 1989.Google Scholar
  18. 18.
    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
  19. 19.
    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
  20. 20.
    K. Vidyasankar. An elegant 1-writer multireader multivalued atomic register. IPL, 30:221–223, 1989.Google Scholar
  21. 21.
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Prasad Jayanti
    • 1
  • Sam Toueg
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA

Personalised recommendations