This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bard Bloom. Constructing two writer atomic registers. In The 6th Annual Symposium on Principles of Distributed Computing, pages 249–259, 1987.
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.
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.
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.
P.J. Courtois, F. Heymans, and D.L. Parnas. Concurrent control with readers and writers. Communications of the ACM, 14(10):667–668, 1971.
Michael Fischer, Nancy Lynch, and Michael Paterson. Impossibility of distributed consensus with one faulty process. JACM, 32(2):374–382, 1985.
M.P. Herlihy. Impossibility and universality results for wait-free synchroniz ation. In The 7th ACM Symposium on Principles of Distributed Computing, 1988.
M.P. Herlihy. Wait-free synchronization. ACM TOPLAS, 13(1):124–149, 1991.
M.P. Herlihy and J.M. Wing. Linearizability: A correctness condition for concurrent objects. ACM TOPLAS, 12(3):463–492, 1990.
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).
Leslie Lamport. Concurrent reading and writing. Communications of the ACM, 20(11):806–811, 1977.
Leslie Lamport. On interprocess communication, parts i and ii. Distributed Computing, 1:77–101, 1986.
M.C Loui and Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in computing research, 4:163–183, 1987.
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.
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.
Gary L. Peterson. Concurrent reading while writing. ACM TOPLAS, 5(1):56–65, 1983.
Serge Plotkin. Sticky bits and universality of consensus. In The 8th ACM Symposium on Principles of Distributed Computing, pages 159–175, August 1989.
R. Schaffer. On the correctness of atomic multi-writer registers. Technical report, TR No: MIT/LCS/TM-364, MIT Laboratory for Computer Science, 1988.
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.
K. Vidyasankar. An elegant 1-writer multireader multivalued atomic register. IPL, 30:221–223, 1989.
P. Vitanyi and B. Awerbuch. Atomic shared register access by asynchronous hardware. In The 27th Annual Symposium on Foundations of Computer Science, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jayanti, P., Toueg, S. (1992). Some results on the impossibility, universality, and decidability of consensus. In: Segall, A., Zaks, S. (eds) Distributed Algorithms. WDAG 1992. Lecture Notes in Computer Science, vol 647. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56188-9_5
Download citation
DOI: https://doi.org/10.1007/3-540-56188-9_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56188-0
Online ISBN: 978-3-540-47484-5
eBook Packages: Springer Book Archive