On the power of shared object types to implement one-resilient Consensus
Pages 101 - 110
References
[1]
Elizabeth Borowsky and Eli Gafni. Generalized FLP impossibility result for t-resilient asynchronous computations, in Proceedings of the Twenty-Fifth A CM Symposium on Theory of Computing, pages 91-100, May 1993.
[2]
James Burns and Nancy Lynch. Mutual exclusion using indivisible reads and writes. In Proceedings of Eighteenth Annual AUerton Conference on Communications, Control and Computing, pages 833- 842, 1980.
[3]
Tushar Chandra, Vassos Hadzilacos, Prasad Jayanti, and Sam Toueg. Wait-freedom versus tresiliency and the robustness of wait-free hierarchies. In Proceedings o! the Thirteenth A CM Symposium on Principles of Distributed Computing, pages 334-343, August 1994.
[4]
Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. Journal o! the ACM, 32(2):374-382, April 1985.
[5]
Maurice Herlihy. Wait-free synchronization. A CM 1~ansactions on Programming Languages and Systems, 11(1):124-149, January 1991.
[6]
Maurice P. Herlihy and Jeannette M. Wing. Linearizability: A correctness condition for concurrent objects. A CM Transactions on Programming Languages and Systems, 12(3):463-492, July 1990.
[7]
Prasad Jayanti. On the robustness of Herlihy's hierarchy. In Proceedings of the Twelfth A CM Symposium on Principles of Distributed Computing, pages 145-158, August 1993.
[8]
Leslie Lamport. How to make a multiprocessot computer that correctly executes multiprocess programs. IEEE ~nsactions on Computers, C- 28(9):690-691, September 1979.
[9]
Leslie Lamport. The mutual exclusion problem: Parts I & II. Journal of the A CM, 33(2):313-348, 1986.
[10]
Wai-Kau Lo. More on t-resilence vs. wait-freedom. In Proceedings of the Fourteenth A CM Symposium on Principles of Distributed Computing, pages 110- 119, August 1995.
[11]
Wai-Kau Lo and Vassos Hadzilacos. On the power of shared object types to irnplement one-resilient consensus. Technical Report CSRI-357, University of Toronto, Toronto, Ontario, Canada, january 1997. Available at ftp: //ftp.cs.utoronto.ca.pub/reports/csri/357.
[12]
Michael Loui and Hosame Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes, in Advances in Computer Research, volume 4, pages 163-183. JAI Press Inc., 1987.
[13]
Michael Stumm and Songnian Zhou. Fault tolerant distributed shared memory. In Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, pages 719-724, December 1990.
Recommendations
On the power of shared object types to implement one-resilient Consensus
In this paper we study the ability of shared object types to implement Consensus in asynchronous shared-memory systems where at most one process may crash. More specifically, we consider the following question: Let n ≥ 3 and S be a set of object types ...
Resilient distributed consensus
MobiHoc '12: Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and ComputingConsensus algorithms allow a set of nodes to reach an agreement on a quantity of interest. For instance, a consensus algorithm may be used to allow a network of sensors to determine the average value of samples collected by the different sensors. ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1997 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 August 1997
Check for updates
Qualifiers
- Article
Conference
PODC97: Sixteenth ACM Symposium on Principles of Distributed Computing
August 21 - 24, 1997
California, Santa Barbara, USA
Acceptance Rates
PODC '97 Paper Acceptance Rate 46 of 149 submissions, 31%;
Overall Acceptance Rate 740 of 2,477 submissions, 30%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 190Total Downloads
- Downloads (Last 12 months)32
- Downloads (Last 6 weeks)4
Reflects downloads up to 16 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in