skip to main content
research-article

A general characterization of indulgence

Published:12 December 2008Publication History
Skip Abstract Section

Abstract

An indulgent algorithm is a distributed algorithm that, besides tolerating process failures, also tolerates unreliable information about the interleaving of the processes. This article presents a general characterization of indulgence in an abstract computing model that encompasses various communication and resilience schemes. We use our characterization to establish several results about the inherent power and limitations of indulgent algorithms.

References

  1. Alpern, B. and Schneider, F. B. 1985. Defining liveness. Inf. Process. Lett. 21, 4, 181--185.Google ScholarGoogle ScholarCross RefCross Ref
  2. Attiya, H., Bar-Noy, A., and Dolev, D. 1995. Sharing memory robustly in message passing systems. J. ACM. 42, 2, 124--142. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Ben-Or, M. 1983. Another advantage of free choice: completely asynchronous agreement protocols (extended abstract). In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM, New York, NY, 27--30. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Chandra, T. D., Hadzilacos, V., and Toueg, S. 1996. The weakest failure detector for solving consensus. J. ACM. 43, 4, 685--722. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Chandra, T. D. and Toueg, S. 1996. Unreliable failure detectors for reliable distributed systems. J. ACM. 43, 2, 225--267. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Chaudhuri, S. 1993. More choices allow more faults: Set consensus problems in totally asynchronous systems. Inform. Comput. 105, 1, 132--158. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Dutta, P. and Guerraoui, R. 2002. The inherent price of indulgence. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM, New York, NY, 88--97. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Dwork, C., Lynch, N. A., and Stockmeyer, L. 1988. Consensus in the presence of partial synchrony. J. ACM 35, 2, 288--323. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Fetzer, C., Schmid, U., and Susskraut, M. 2005. On the possibility of consensus in asynchronous systems with finite average response times. In Proceedings of the International Conference on Distributed Computing Systems (ICDCS). IEEE Computer Society, Los Alamitos, CA. 271--280. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Fischer, M. J., Lynch, N. A., and Paterson, M. S. 1985. Impossibility of distributed consensus with one faulty process. J. ACM. 32, 2, 374--382. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Guerraoui, R. 2000. Indulgent algorithms (preliminary version). In Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM, New York, NY, 289--297. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Guerraoui, R. 2001. On the hardness of failure sensitive agreement problems. Inf. Process. Lett. 79. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Guerraoui, R. 2002. Non-blocking atomic commit in asynchronous distributed systems with failure detectors. Distrib. Comput. 15, 1, 17--25. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Guerraoui, R. and Raynal, M. 2004. The information structure of indulgent consensus. IEEE Trans. Comput. 53, 4, 453--466. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Hadzilacos, V. and Toueg, S. 1993. Fault-tolerant broadcasts and related problems. In Distributed Systems, S. J. Mullender, Ed. Addison-Wesley, Chapter 5, 97--145. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Herlihy, M. P. 1991. Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13, 1, 123--149. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Keidar, I. and Shraer, A. 2006. Timeliness, failure detectors and consensus peformance. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM, New York, NY. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Lamport, L. 1977. Proving the correctness of multiprocessor programs. IEEE Trans. Softw. Eng. 3, 2, 125--143. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Lamport, L. 1979. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput. C-28, 9, 690--691. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Lamport, L. 1998. The part-time parliament. ACM Trans. Comput. Sys. 16, 2, 133--169. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Lamport, L., Shostak, R., and Pease, M. 1982. The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4, 3, 382--401. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Lynch, N. A. 1996. Distributed Algorithms. Morgan Kaufmann. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Mostefaoui, A., Raynal, M., and Travers, C. 2004. Crash-resilient time-free eventual leadership. In Proceedings of the IEEE International Symposium on Reliable Distributed Systems (SRDS). IEEE Computer Society, Los Alamitos, CA, 208--217. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Sampaio, L. and Brasileiro, F. 2005. Adaptive indulgent consensus. In Proceedings of the International Conference on Dependable Systems and Networks (DSN). 422--431. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Skeen, D. 1981. Nonblocking commit protocols. In Proceedings of the ACM International Conference on Management of Data (SIGMOD). Y. E. Lien, Ed. ACM Press, New York, NY, 133--142. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Taubenfeld, G. 2007. Computing in the presence of timing failures. In Proceedings of the IEEE International Conference on Distributed Computing Systems (ICDCS). IEEE Computer Society, Los Alamitos, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Vicente, P. and Rodrigues, L. 2002. An indulgent uniform total order broadcast algorithm with optimistic delivery. In Proceedings of the IEEE International Symposium on Reliable Distributed Systems (SRDS). IEEE Computer Society, Los Alamitos, CA, 92--80. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Voelzer, H. 2004. A constructive proof for flp. Inf. Process. Lett. 92. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Widder, J., Lann, G. L., and Schmid, U. 2005. Failure detection with booting in partially synchronous systems. In Proceedings of the 5th European Dependable Computing Conference. Lecture Notes in Computer Science, vol. 3464. Springer, Berlin, Germany. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Zielinski, P. 2006. Optimistically terminating consensus. In Proceedings of the IEEE International Symposium on Parallel and Distributed Computing (ISPDC). IEEE Computer Society, Los Alamitos, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A general characterization of indulgence

          Recommendations

          Comments

          Login options

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

          Sign in

          Full Access

          • Published in

            cover image ACM Transactions on Autonomous and Adaptive Systems
            ACM Transactions on Autonomous and Adaptive Systems  Volume 3, Issue 4
            November 2008
            171 pages
            ISSN:1556-4665
            EISSN:1556-4703
            DOI:10.1145/1452001
            Issue’s Table of Contents

            Copyright © 2008 ACM

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 12 December 2008
            • Accepted: 1 September 2008
            • Revised: 1 August 2008
            • Received: 1 March 2007
            Published in taas Volume 3, Issue 4

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article
            • Research
            • Refereed

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!