Skip to main content
SpringerLink
Log in

The Computational Structure of Progress Conditions

  • Conference paper
Distributed Computing (DISC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6343))

Included in the following conference series:

Abstract

Understanding the effect of different progress conditions on the computability of distributed systems is an important and exciting research direction. For a system with n processes, we define exponentially many new progress conditions and explore their properties and strength. We cover all the known, symmetric and asymmetric, progress conditions and many new interesting conditions. Together with our technical results, the new definitions provide a deeper understanding of synchronization and concurrency.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aguilera, M.K., Toueg, S.: Timeliness-based wait-freedom: a gracefully degrading progress condition. In: Proc. 27rd ACM Symp. on Principles of Distributed Computing, pp. 305–314 (2008)

    Google Scholar 

  2. Attiya, H., Guerraoui, R., Kouznetsov, P.: Computing with reads and writes in the absence of step contention. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 122–136. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmann, A.: The disagreement power of an adversary. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 8–21. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Fich, F.E., Ruppert, E.: Hundreds of impossibility results for distributed computing. Distributed Computing 16(2-3), 121–163 (2003)

    Article  Google Scholar 

  5. Fich, E.F., Luchangco, V., Moir, M., Shavit, N.: Obstruction-free algorithms can be practically wait-free. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 78–92. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM 32(2), 374–382 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  7. Guerraoui, R., Herlihy, M.P., Pochon, B.: Towards a theory of transactional contention managers. In: Proc. of the 24th Symp. on Principles of Dist. Computing, pp. 258–264 (2005)

    Google Scholar 

  8. Guerraoui, R., Kapalka, M., Kouznetsov, P.: The weakest failure detectors to boost obstruction-freedom. Distributed Computing 20(6), 415–433 (2008)

    Article  Google Scholar 

  9. Guerraoui, R., Kouznetsov, P.: Failure detectors as type boosters. Distributed Computing 20, 343–358 (2008)

    Article  Google Scholar 

  10. Herlihy, M.P.: Wait-free synchronization. ACM Trans. on Programming Languages and Systems 13(1), 124–149 (1991)

    Article  Google Scholar 

  11. Herlihy, M.P., Luchangco, V., Moir, M.: Obstruction-free synchronization: Double-ended queues as an example. In: Proc. of the 23rd Int. Conf. on Dist. Computing Systems (2003)

    Google Scholar 

  12. Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. TOPLAS 12(3), 463–492 (1990)

    Article  Google Scholar 

  13. Imbs, D., Raynal, M., Taubenfeld, G.: On asymmetric progress conditions. In: Proc. 29th ACM Symp. on Principles of Distributed Computing (to appear, 2010)

    Google Scholar 

  14. Jayanti, P.: Robust wait-free hierarchies. Journal of the ACM 44(4), 592–614 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  15. Jayanti, P., Toueg, S.: Some results on the impossibility, universality, and decidability of consensus. In: Segall, A., Zaks, S. (eds.) WDAG 1992. LNCS, vol. 647, pp. 69–84. Springer, Heidelberg (1992)

    Google Scholar 

  16. Lo, W.-K., Hadzilacos, V.: All of us are smarter than any of us: Nondeterministic wait-free hierarchies are not robust. SIAM Journal on Computing 30(3), 689–728 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  17. Luchangco, V., Moir, M., Shavit, N.: On the uncontended complexity of consensus. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol. 2848, pp. 45–59. Springer, Heidelberg (2003)

    Google Scholar 

  18. Loui, M.C., Abu-Amara, H.: Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research 4, 163–183 (1987)

    MathSciNet  Google Scholar 

  19. Merritt, M., Taubenfeld, G.: Resilient consensus for infinitely many processes. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol. 2848, pp. 1–15. Springer, Heidelberg (2003)

    Google Scholar 

  20. Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM 27(2), 228–234 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  21. Plotkin, S.A.: Sticky bits and universality of consensus. In: Proc. 8th ACM Symp. on Principles of Distributed Computing, pp. 159–175 (1989)

    Google Scholar 

  22. Scherer, W.N., Scott, M.L.: Advanced contention management for dynamic software transactional memory. In: Proc. of the 24th Symp. on Principles of Dist. Computing, pp. 240–248 (2005)

    Google Scholar 

  23. Taubenfeld, G.: Synchronization Algorithms and Concurrent Programming. Pearson/Prentice-Hall (2006) ISBN 0-131-97259-6

    Google Scholar 

  24. Taubenfeld, G.: Contention-sensitive data structures and algorithms. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 157–171. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  25. Taubenfeld, G.: On the computational power of shared objects. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol. 5923, pp. 270–284. Springer, Heidelberg (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Interdisciplinary Center, P.O. Box 167, Herzliya, 46150, Israel

    Gadi Taubenfeld

Authors
  1. Gadi Taubenfeld
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, 02139-4307, Cambridge, MA, USA

    Nancy A. Lynch

  2. Computer Science and Engineering, University of Connecticut, 371 Fairfield Way, Unit 2155, 06269, Storrs, CT, USA

    Alexander A. Shvartsman

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Taubenfeld, G. (2010). The Computational Structure of Progress Conditions. In: Lynch, N.A., Shvartsman, A.A. (eds) Distributed Computing. DISC 2010. Lecture Notes in Computer Science, vol 6343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15763-9_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15763-9_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15762-2

  • Online ISBN: 978-3-642-15763-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation