research-article

Tight failure detection bounds on atomic object implementations

Authors:

Carole Delporte-Gallet,

Hugues Fauconnier,

Rachid GuerraouiAuthors Info & Claims

Journal of the ACM (JACM), Volume 57, Issue 4

Article No.: 22, Pages 1 - 32

https://doi.org/10.1145/1734213.1734216

Published: 03 May 2010 Publication History

Abstract

This article determines the weakest failure detectors to implement shared atomic objects in a distributed system with crash-prone processes. We first determine the weakest failure detector for the basic register object. We then use that to determine the weakest failure detector for all popular atomic objects including test-and-set, fetch-and-add, queue, consensus and compare-and-swap, which we show is the same.

References

[1]

Aguilera, M., Delporte-Gallet, C., Fauconnier, H., and Toueg, S. 2000. Thrifty generic broadcast. In Proceedings of the 14th International Symposium on Distributed Computing. Lecture Notes in Computer Science, vol. 1914. Springer-Verlag, Berlin, Germany, 268--283.

Digital Library

[2]

Attiya, H., Bar-Noy, A., and Dolev, D. 1995. Sharing memory robustly in message passing systems. J. ACM 42, 2 (Jan.), 124--142.

Digital Library

[3]

Attiya, H., and Welch, J. 1998. Distributed Computing. Fundamentals, Simulations, and Advanced Topics. McGraw-Hill, New York.

Digital Library

[4]

Bazzi, R. A., Neiger, G., and Peterson, G. L. 1997. On the use of registers in achieving wait-free consensus. Distrib. Comput. 10, 3, 117--127.

Digital Library

[5]

Chandra, T. D., Hadzilacos, V., and Toueg, S. 1996. The weakest failure detector for solving consensus. J. ACM 43, 4 (July), 685--722.

Digital Library

[6]

Chandra, T. D., and Toueg, S. 1996. Unreliable failure detectors for reliable distributed systems. J. ACM 43, 2 (Mar.), 225--267.

Digital Library

[7]

Fischer, M. J., Lynch, N. A., and Paterson, M. S. 1985. Impossibility of distributed consensus with one faulty process. J. ACM 32, 2 (Apr.), 374--382.

Digital Library

[8]

Hadzilacos, V., and Toueg, S. 1993. Fault-tolerant broadcasts and related problems. In Distributed Systems. Addison-Wesley, Reading, MA, Chapter 5, 97--145.

Digital Library

[9]

Herlihy, M., and Wing, J. M. 1990. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12, 3, 463--492.

Digital Library

[10]

Herlihy, M. P. 1991. Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13, 1 (Jan.), 123--149.

Digital Library

[11]

Israeli, A., and Li, M. 1993. Bounded time-stamps. Distrib. Comput. 6, 4 (July), 205--209.

Digital Library

[12]

Jayanti, P. 1993. On the robustness of Herlihy's hierarchy. In Proceedings of the 12th ACM Symposium on Principles of Distributed Computing. ACM, New York, 145--157.

Digital Library

[13]

Lamport, L. 1978. Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21, 7 (July), 558--565.

Digital Library

[14]

Lamport, L. 1986. On interprocess communication; part I and II. Distrib. Comput. 1, 2, 77--101.

[15]

Lamport, L. 1998. The Part-Time parliament. ACM Trans. Comput. Syst. 16, 2 (May), 133--169.

Digital Library

[16]

Loui, M., and Abu-Amara, H. 1987. Memory requirements for agreement among unreliable asynchronous processes. Adv. Comput. Res. 4, 163--183.

[17]

Schneider, F. 1986. The state machine approach: A tutorial. In Fault-Tolerant Distributed Computing. Lecture Notes in Computer Science, vol. 448. Springer-Verlag, Berlin, Germany, 18--41.

Digital Library

[18]

Vitanyi, P., and Awerbuch, B. 1986. Atomic shared register access by asynchronous hardware. In Proceedings of the IEEE Symposium om Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 233--243.

Digital Library

Cited By

Delporte-Gallet CFauconnier HRaynal M(2021)On the weakest information on failures to solve mutual exclusion and consensus in asynchronous crash-prone read/write systemsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2021.03.015153(110-118)Online publication date: Jul-2021
https://doi.org/10.1016/j.jpdc.2021.03.015
Mauffret EJeanneau ÉArantes LSens PHansdah RKrishnaswamy DVaidya N(2019)The weakest failure detector to solve the mutual exclusion problem in an unknown dynamic environmentProceedings of the 20th International Conference on Distributed Computing and Networking10.1145/3288599.3288608(11-20)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.1145/3288599.3288608
Delporte-Gallet CFauconnier HRaynal M(2019)Participant-Restricted Consensus in Asynchronous Crash-Prone Read/Write Systems and Its Weakest Failure DetectorParallel Computing Technologies10.1007/978-3-030-25636-4_33(419-430)Online publication date: 17-Jul-2019
https://doi.org/10.1007/978-3-030-25636-4_33
Show More Cited By

Index Terms

Tight failure detection bounds on atomic object implementations

Recommendations

Single-scanner multi-writer snapshot implementations are fast!
PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing

Snapshot objects allow processes to obtain consistent global views of shared memory. A snapshot object consists of m components each capable of storing a value. The processes execute UPDATE operations to write new values in any of the components and ...
Non-blocking atomic commit in asynchronous distributed systems with failure detectors

This paper addresses the Non-Blocking Atomic Commit (NB-AC) problem in asynchronous distributed systems augmented with failure detectors. We first show that, in these systems, NB-AC and Consensus are incomparable. Roughly speaking, there is a failure ...
Unreliable failure detectors for reliable distributed systems

We introduce the concept of unreliable failure detectors and study how they can be used to solve Consensus in asynchronous systems with crash failures. We characterise unreliable failure detectors in terms of two properties—completeness and accuracy. We ...

Comments

Information & Contributors

Information

Published In

cover image Journal of the ACM

Journal of the ACM Volume 57, Issue 4

April 2010

236 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/1734213

Issue’s Table of Contents

Copyright © 2010 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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 May 2010

Accepted: 01 December 2009

Revised: 01 August 2008

Received: 01 November 2005

Published in JACM Volume 57, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Polish Ministry of Science and Education

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

36
Total Citations
View Citations
507
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Delporte-Gallet CFauconnier HRaynal M(2021)On the weakest information on failures to solve mutual exclusion and consensus in asynchronous crash-prone read/write systemsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2021.03.015153(110-118)Online publication date: Jul-2021
https://doi.org/10.1016/j.jpdc.2021.03.015
Mauffret EJeanneau ÉArantes LSens PHansdah RKrishnaswamy DVaidya N(2019)The weakest failure detector to solve the mutual exclusion problem in an unknown dynamic environmentProceedings of the 20th International Conference on Distributed Computing and Networking10.1145/3288599.3288608(11-20)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.1145/3288599.3288608
Delporte-Gallet CFauconnier HRaynal M(2019)Participant-Restricted Consensus in Asynchronous Crash-Prone Read/Write Systems and Its Weakest Failure DetectorParallel Computing Technologies10.1007/978-3-030-25636-4_33(419-430)Online publication date: 17-Jul-2019
https://doi.org/10.1007/978-3-030-25636-4_33
Delporte-Gallet CFauconnier HRaynal M(2019)On the Weakest Failure Detector for Read/Write-Based Mutual ExclusionAdvanced Information Networking and Applications10.1007/978-3-030-15032-7_24(272-285)Online publication date: 15-Mar-2019
https://doi.org/10.1007/978-3-030-15032-7_24
Jeanneau ÉRieutord TArantes LSens P(2017)Solving k-Set Agreement Using Failure Detectors in Unknown Dynamic NetworksIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2016.260882928:5(1484-1499)Online publication date: 1-May-2017
https://dl.acm.org/doi/10.1109/TPDS.2016.2608829
Dubois SGuerraoui RKuznetsov PPetit FSens P(2017)The weakest failure detector for eventual consistencyDistributed Computing10.1007/s00446-016-0292-932:6(479-492)Online publication date: 5-Jan-2017
https://doi.org/10.1007/s00446-016-0292-9
Bouzid ZTravers C(2016)Anonymity-Preserving Failure DetectorsDistributed Computing10.1007/978-3-662-53426-7_13(173-186)Online publication date: 4-Sep-2016
https://doi.org/10.1007/978-3-662-53426-7_13
Delporte-Gallet CFauconnier H(2016)Asynchronous Consensus with Bounded MemoryNetworked Systems10.1007/978-3-319-46140-3_12(154-168)Online publication date: 15-Sep-2016
https://doi.org/10.1007/978-3-319-46140-3_12
Raynal M(2016)Message AdversariesEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_609(1272-1276)Online publication date: 22-Apr-2016
https://doi.org/10.1007/978-1-4939-2864-4_609
Dubois SGuerraoui RKuznetsov PPetit FSens PGeorgiou CSpirakis P(2015)The Weakest Failure Detector for Eventual ConsistencyProceedings of the 2015 ACM Symposium on Principles of Distributed Computing10.1145/2767386.2767404(375-384)Online publication date: 21-Jul-2015
https://dl.acm.org/doi/10.1145/2767386.2767404
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents