Skip to main content
SpringerLink
Log in

Correctness of Self-stabilizing Algorithms under the Dolev Model When Adapted to Composite Atomicity Models

  • Conference paper
Advances in Intelligent Systems and Applications - Volume 2

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 21))

Abstract

In this paper, we first clarify that it is not a trivial matter whether or not a self-stabilizing algorithm under the Dolev model, when adapted to a composite atomicity model, is also self-stabilizing. Then we employ a particular “simulation” approach to show that if a self-stabilizing algorithm under the Dolev model has one of two certain forms, then it is also self-stabilizing when adapted to one of the composite atomicity models, the fair daemon model. Since most existing self-stabilizing algorithms under the Dolev model have the above-mentioned forms, our results imply that they are all self-stabilizing when adapted to the fair daemon model.

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 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover 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. Burns, J.E.: Self-stabilizing Rings without Daemons. Technical report, Georgia Tech (1987)

    Google Scholar 

  2. Collin, Z., Dolev, S.: Self-stabilizing Depth-first Search. Inform. Process. Lett. 49, 297–301 (1994)

    Article  MATH  Google Scholar 

  3. Dijkstra, E.W.: Self-stabilizing Systems in Spite of Distributed Control. Comm. ACM 17, 643–644 (1974)

    Article  MATH  Google Scholar 

  4. Dolev, S.: Self-stabilization. MIT Press (2000)

    Google Scholar 

  5. Dolev, S., Israeli, A., Moran, S.: Self-stabilization of Dynamic Systems Assuming Only Read/Write Atomicity. In: 9th Annual ACM Symposium on Principles of Distributed Computing, Quebec, Canada, pp. 103–117 (1990)

    Google Scholar 

  6. Dolev, S., Israeli, A., Moran, S.: Self-stabilization of Dynamic Systems Assuming Only Read/Write Atomicity. Distrib. Comput. 7, 3–16 (1993)

    Article  Google Scholar 

  7. Ghosh, S., Gupta, A.: An Exercise in Fault-containment: Self-stabilizing Leader Election. Inform. Process. Lett. 59, 281–288 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  8. Ghosh, S., Gupta, A., Herman, T., Pemmaraju, S.V.: Fault-containing Self-stabilizing Algorithm. In: 15th ACM Symposium on Principles of Distributed Computing, Philadelphia, USA, pp. 45–54 (1996)

    Google Scholar 

  9. Ghosh, S., Gupta, A., Pemmaraju, S.V.: A Fault-containing Self-stabilizing Spanning Tree Algorithm. J. Comput. Inform. 2, 322–338 (1996)

    Google Scholar 

  10. Huang, T.C.: A Self-stabilizing Algorithm for the Shortest Path Problem Assuming Read/Write Atomicity. J. Comput. Syst. Sci. 71, 70–85 (2005)

    Article  MATH  Google Scholar 

  11. Huang, S.T., Chen, N.S.: A Self-stabilizing Algorithm for Constructing Breadth-first Trees. Inform. Process. Lett. 41, 109–117 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  12. Hsu, S.C., Huang, S.T.: A Self-stabilizing Algorithm for Maximal Matching. Inform. Process. Lett. 43, 77–81 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  13. Huang, T.C., Lin, J.C.: A Self-stabilizing Algorithm for the Shortest Path Problem in a Distributed System. Comput. Math. Appl. 43, 103–109 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  14. Huang, T.C., Lin, J.C., Chen, H.J.: A Self-stabilizing Algorithm which Finds a 2-center of a Tree. Comput. Math. Appl. 40, 607–624 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  15. Huang, T.C., Lin, J.C., Chen, C.Y., Wang, C.P.: A Self-stabilizing Algorithm for Finding a Minimal 2-dominating Set Assuming the Distributed Demon Model. Comput. Math. Appl. 54, 350–356 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  16. Huang, T.C., Lin, J.C., Mou, N.: A Self-stabilizing Algorithm for the Center-finding Problem Assuming Read/Write Atomicity. Comput. Math. Appl. 48, 1667–1676 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  17. Ikeda, M., Kamei, S., Kakugawa, H.: A Space-optimal Self-stabilizing Algorithm for the Maximal Independent Set Problem. In: 3rd International Conference on Parallel and Distributed Computing, Applications and Technologies, Kanazawa, Japan, pp. 70–74 (2002)

    Google Scholar 

  18. Shukla, S., Rosenkrantz, D.J., Ravi, S.S.: Observations on Self-stabilizing Graph Algorithms on Anonymous Networks. In: 2nd Workshop on Self-stabilizing Systems, p. 7.1–7.15. Las Vegas, USA (1995)

    Google Scholar 

  19. Tsin, Y.H.: An Improved Self-stabilizing Algorithm for Biconnectivity and Bridge-connectivity. Inform. Process. Lett. 102, 27–34 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  20. Turau, V.: Linear Self-stabilizing Algorithms for the Independent and Dominating Set Problems Using an Unfair Distributed Scheduler. Inform. Process. Lett. 103, 88–93 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  21. Turau, V., Hauck, B.: A Self-stabilizing Algorithm for Constructing Weakly Connected Minimal Dominating Sets. Inform. Process. Lett. 109, 763–767 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  22. Tzeng, C.H., Jiang, J.R., Huang, S.T.: A Self-stabilizing (Δ + 4)-edge-coloring Algorithm for Planar Graphs in Anonymous Uniform Systems. Inform. Process. Lett. 101, 168–173 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, Taoyuan Innovation Institute of Technology, 414, Sec. 3, Chung-Shan East Road, Chung-Li, Tao-Yuan, 320, Taiwan

    Chih-Yuan Chen

  2. General Education Center, Tzu Chi College of Technology, 880, Sec. 2, Chien-kuo Rd., Hualien, Taiwan

    Cheng-Pin Wang

  3. Department of Computer Science and Engineering, Yuan-Ze University, 135 Yuan-Tung Road, Chung-Li, Tao-Yuan, 320, Taiwan

    Tetz C. Huang & Ji-Cherng Lin

Authors
  1. Chih-Yuan Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cheng-Pin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tetz C. Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ji-Cherng Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. of Applied Sciences, Department of Electronic Engineering, National Kaohsiung University, Jiàngōng Road, Kaohsiung, 807, Taiwan R.O.C.

    Jeng-Shyang Pan

  2. , Department of Computer Science and, National Dong Hwa University, #1, Sec. 2, Da Hsueh Rd., Hualien, Taiwan R.O.C.

    Ching-Nung Yang

  3. , Department of Computer Science and, Providence University, #200, Chung-shi Rd., Taichung, Taiwan R.O.C.

    Chia-Chen Lin

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, CY., Wang, CP., Huang, T.C., Lin, JC. (2013). Correctness of Self-stabilizing Algorithms under the Dolev Model When Adapted to Composite Atomicity Models. In: Pan, JS., Yang, CN., Lin, CC. (eds) Advances in Intelligent Systems and Applications - Volume 2. Smart Innovation, Systems and Technologies, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35473-1_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35473-1_57

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35472-4

  • Online ISBN: 978-3-642-35473-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation