Skip to main content
Springer Nature Link
Log in

A Tranformational Approach for Designing Scheduler-Oblivious Self-stabilizing Algorithms

  • Conference paper
  • First Online:
Stabilization, Safety, and Security of Distributed Systems (SSS 2010)

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

Included in the following conference series:

  • 661 Accesses

Abstract

The complexity of designing self-stabilizing systems is often compounded by the assumptions about the underlying schedulers. This paper presents a method to transform a self-stabilizing algorithm working under a given arbitrary, but potentially very restrictive, scheduler to a self-stabilizing algorithm under any weakly fair scheduler. The method presented here implements a progress monitor by exploiting the knowledge of a ranking function –used for proving convergence under the original scheduler– to carry out the transformation.

This work was supported by the German Research Foundation (DFG) under grant SFB/TR 14/2 “AVACS.”

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Perlman, R.: Interconnections: bridges, routers, switches, and internetworking protocols. Addison-Wesley Longman, Amsterdam (1999)

    Google Scholar 

  2. Tsuchiya, T., Nagano, S., Paidi, R.B., Kikuno, T.: Symbolic model checking for self-stabilizing algorithms. IEEE Trans. Parallel Distrib. Syst. 12, 81–95 (2001)

    Article  Google Scholar 

  3. Burns, J.E., Gouda, M.G., Miller, R.E.: On Relaxing Interleaving Assumptions. In: Proc. MCC Workshop on Self-Stabilization. MCC Tech. Rep. STP, pp. 379–389 (1989)

    Google Scholar 

  4. Gouda, M.G., Haddix, F.F.: The alternator. Distributed Computing 20, 21–28 (2007)

    Article  Google Scholar 

  5. Gouda, M.G.: The Theory of Weak Stabilization. In: Datta, A.K., Herman, T. (eds.) WSS 2001. LNCS, vol. 2194, pp. 114–123. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Devismes, S., Tixeuil, S., Yamashita, M.: Weak vs. Self vs. Probabilistic Stabilization. In: ICDCS, pp. 681–688. IEEE Computer Society, Los Alamitos (2008)

    Google Scholar 

  7. Basu, A., Bensalem, S., Peled, D., Sifakis, J.: Priority Scheduling of Distributed Systems Based on Model Checking. In: Bouajjani, A., Maler, O. (eds.) Computer Aided Verification. LNCS, vol. 5643, pp. 79–93. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. Balaban, I., Pnueli, A., Zuck, L.D.: Modular Ranking Abstraction. Int. J. Found. Comput. Sci. 18, 5–44 (2007)

    Article  MathSciNet  Google Scholar 

  9. Völzer, H., Varacca, D., Kindler, E.: Defining Fairness. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 458–472. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Dolev, S.: Self-Stabilization. The MIT Press, Cambridge (2000)

    Book  Google Scholar 

  11. Kessels, J.L.W.: An Exercise in Proving Self-Stabilization with a Variant Function. Inf. Process. Lett. 29, 39–42 (1988)

    Article  MathSciNet  Google Scholar 

  12. Theel, O.: Exploitation of Ljapunov Theory for Verifying Self-Stabilizing Algorithms. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 209–222. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  13. Afek, Y., Kutten, S., Yung, M.: The Local Detection Paradigm and Its Application to Self-Stabilization. Theor. Comput. Sci. 186, 199–229 (1997)

    Article  MathSciNet  Google Scholar 

  14. Dolev, S., Israeli, A., Moran, S.: Self-Stabilization of Dynamic Systems Assuming Only Read/Write Atomicity. Distributed Computing 7, 3–16 (1993)

    Article  Google Scholar 

  15. Boulinier, C., Petit, F.: Self-stabilizing wavelets and rho-hops coordination. In: Intl. Sym. Parallel and Distributed Processing, pp. 1–8. IEEE, Los Alamitos (2008)

    Google Scholar 

  16. Danturi, P., Nesterenko, M., Tixeuil, S.: Self-Stabilizing Philosophers with Generic Conflicts. ACM Trans. Autonomous and Adaptive Systems 4 (2009)

    Google Scholar 

  17. Katz, S., Perry, K.J.: Self-Stabilizing Extensions for Message-Passing Systems. Distributed Computing 7, 17–26 (1993)

    Article  Google Scholar 

  18. Awerbuch, B., Varghese, G.: Distributed Program Checking: a Paradigm for Building Self-stabilizing Distributed Protocols. In: FOCS, pp. 258–267 (1991)

    Google Scholar 

  19. Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-Stabilization By Local Checking and Correction. In: FOCS, pp. 268–277 (1991)

    Google Scholar 

  20. Afek, Y., Dolev, S.: Local Stabilizer. J. Parallel Distrib. Comput. 62, 745–765 (2002)

    Article  Google Scholar 

  21. Beauquier, J., Delaët, S., Dolev, S., Tixeuil, S.: Transient Fault Detectors. In: Kutten, S. (ed.) DISC 1998. LNCS, vol. 1499, pp. 62–74. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  22. Arora, A., Gouda, M.G.: Distributed Reset. IEEE ToC 43, 1026–1038 (1994)

    MATH  Google Scholar 

  23. Mizuno, M., Kakugawa, H.: A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing Environments. In: Babaoğlu, Ö., Marzullo, K. (eds.) WDAG 1996. LNCS, vol. 1151, pp. 304–321. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  24. Kakugawa, H., Mizuno, M., Nesterenko, M.: Development of Self-Stabilizing Distributed Algorithms using Transformation: Case Studies. In: WSS, pp. 16–30. Carleton University Press (1997)

    Google Scholar 

  25. Chandy, K.M., Misra, J.: The Drinking Philosopher’s Problem. ACM ToPLaS 6, 632–646 (1984)

    Article  Google Scholar 

  26. Beauquier, J., Datta, A.K., Gradinariu, M., Magniette, F.: Self-Stabilizing Local Mutual Exclusion and Daemon Refinement. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 223–237. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  27. Nesterenko, M., Arora, A.: Stabilization-Preserving Atomicity Refinement. J. Parallel Distrib. Comput. 62, 766–791 (2002)

    Article  Google Scholar 

  28. Boulinier, C., Petit, F., Villain, V.: When Graph Theory helps Self-Stabilization. In: Proc. 23rd Annual ACM Symposium on Principles of Distributed Computing, pp. 150–159 (2004)

    Google Scholar 

  29. Beauquier, J., Gradinariu, M., Johnen, C.: Cross-Over Composition - Enforcement of Fairness under Unfair Adversary. In: Datta, A.K., Herman, T. (eds.) WSS 2001. LNCS, vol. 2194, pp. 19–34. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  30. Beauquier, J., Johnen, C., Messika, S.: All k -Bounded Policies Are Equivalent for Self-stabilization. In: Datta, A.K., Gradinariu, M. (eds.) SSS 2006. LNCS, vol. 4280, pp. 82–94. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  31. Karaata, M.H.: Self-Stabilizing Strong Fairness under Weak Fairness. IEEE Trans. Parallel Distrib. Syst. 12, 337–345 (2001)

    Article  Google Scholar 

  32. Lang, M., Sivilotti, P.A.G.: A Distributed Maximal Scheduler for Strong Fairness. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 358–372. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Oldenburg, Germany

    Abhishek Dhama & Oliver Theel

Authors
  1. Abhishek Dhama
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oliver Theel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Ben-Gurion University of the Negev,Beer-Sheva, 84105, Israel

    Shlomi Dolev

  2. Department of Computer Science, The University of Texas at Dallas, TX 75083-0688, Richardson, USA

    Jorge Cobb

  3. Department of Computer Science, Yale University, 51 Prospect Street, CT 06511, New Haven, USA

    Michael Fischer

  4. Department of Computer Science, Columbia University, 10027, New York, NY, USA

    Moti Yung

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dhama, A., Theel, O. (2010). A Tranformational Approach for Designing Scheduler-Oblivious Self-stabilizing Algorithms. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2010. Lecture Notes in Computer Science, vol 6366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16023-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16023-3_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16022-6

  • Online ISBN: 978-3-642-16023-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics