Skip to main content
Springer Nature Link
Log in

Extending Lattice Linearity for Self-stabilizing Algorithms

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

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

  • 721 Accesses

Abstract

In this article, we focus on extending the notion of lattice linearity to self-stabilizing programs. Lattice linearity allows a node to execute its actions with old information about the state of other nodes and still preserve correctness. It increases the concurrency of the program execution by eliminating the need for synchronization among its nodes.

The extension –denoted as eventually lattice linear algorithms– is performed with an example of the service-demand based minimal dominating set (SDDS) problem, which is a generalization of the dominating set problem; it converges in 2n moves. Subsequently, we also show that the same approach could be used in various other problems including minimal vertex cover, maximal independent set and graph coloring.

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

Similar content being viewed by others

References

  1. Arora, A., Gouda, M.: Closure and convergence: a foundation of fault-tolerant computing. IEEE Trans. Software Eng. 19(11), 1015–1027 (1993)

    Article  Google Scholar 

  2. Chiu, W.Y., Chen, C., Tsai, S.-Y.: A 4n-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon. Inf. Process. Lett. 114(10), 515–518 (2014)

    Article  MathSciNet  Google Scholar 

  3. Fink, J.F., Jacobson, M.S.: N-Domination in Graphs, pp. 283–300. Wiley, Hoboken (1985)

    MATH  Google Scholar 

  4. Garg, V.K.: Predicate detection to solve combinatorial optimization problems. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. SPAA 2020, pp. 235–245. Association for Computing Machinery, New York (2020)

    Google Scholar 

  5. Garg, V.K.: A lattice linear predicate parallel algorithm for the dynamic programming problems. CoRR abs/2103.06264 (2021)

    Google Scholar 

  6. Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K., Xu, Z.: Self-stabilizing graph protocols. Parallel Process. Lett. 18(01), 189–199 (2008)

    Article  MathSciNet  Google Scholar 

  7. Guellati, N., Kheddouci, H.: A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs. J. Parallel Distrib. Comput. 70(4), 406–415 (2010)

    Article  Google Scholar 

  8. Gupta, A.T., Kulkarni, S.S.: Extending lattice linearity for self-stabilizing algorithms. CoRR abs/2109.13216 (2021)

    Google Scholar 

  9. Hedetniemi, S., Hedetniemi, S., Jacobs, D., Srimani, P.: Self-stabilizing algorithms for minimal dominating sets and maximal independent sets. Comput. Math. Appl. 46(5), 805–811 (2003)

    Article  MathSciNet  Google Scholar 

  10. Kamei, S., Kakugawa, H.: A self-stabilizing algorithm for the distributed minimal k-redundant dominating set problem in tree networks. In: Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies, pp. 720–724 (2003)

    Google Scholar 

  11. Kamei, S., Kakugawa, H.: A self-stabilizing approximation algorithm for the distributed minimum k-domination. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E88-A(5), 1109–1116 (2005)

    Google Scholar 

  12. Kiniwa, J.: Approximation of self-stabilizing vertex cover less than 2. In: Tixeuil, S., Herman, T. (eds.) SSS 2005. LNCS, vol. 3764, pp. 171–182. Springer, Heidelberg (2005). https://doi.org/10.1007/11577327_12

    Chapter  MATH  Google Scholar 

  13. Kobayashi, H., Kakugawa, H., Masuzawa, T.: Brief announcement: a self-stabilizing algorithm for the minimal generalized dominating set problem. In: Spirakis, P., Tsigas, P. (eds.) SSS 2017. LNCS, vol. 10616, pp. 378–383. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-69084-1_27

    Chapter  Google Scholar 

  14. Leal, W., Arora, A.: Scalable self-stabilization via composition. In: 2004 Proceedings of the 24th International Conference on Distributed Computing Systems, pp. 12–21 (2004)

    Google Scholar 

  15. Åstrand, M., Suomela, J.: Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. In: Proceedings of the Twenty-Second Annual ACM Symposium on Parallelism in Algorithms and Architectures. SPAA 2010, pp. 294–302. Association for Computing Machinery, New York (2010)

    Google Scholar 

  16. Turau, V.: Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler. Inf. Process. Lett. 103(3), 88–93 (2007)

    Article  MathSciNet  Google Scholar 

  17. Turau, V.: Self-stabilizing vertex cover in anonymous networks with optimal approximation ratio. Parallel Process. Lett. 20(02), 173–186 (2010)

    Article  MathSciNet  Google Scholar 

  18. Varghese, G.: Self-stabilization by local checking and correction. Ph.D thesis, Massachusetts Institute of Technology, October 1992

    Google Scholar 

  19. Xu, Z., Hedetniemi, S.T., Goddard, W., Srimani, P.K.: A synchronous self-stabilizing minimal domination protocol in an arbitrary network graph. In: Das, S.R., Das, S.K. (eds.) IWDC 2003. LNCS, vol. 2918, pp. 26–32. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-24604-6_3

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science and Engineering, Michigan State University, East Lansing, USA

    Arya Tanmay Gupta & Sandeep S. Kulkarni

Authors
  1. Arya Tanmay Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sandeep S. Kulkarni
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Arya Tanmay Gupta .

Editor information

Editors and Affiliations

  1. University of Bordeaux, Bordeaux, France

    Colette Johnen

  2. Chalmers University of Technology, Gothenburg, Sweden

    Elad Michael Schiller

  3. University of Vienna, Vienna, Austria

    Stefan Schmid

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gupta, A.T., Kulkarni, S.S. (2021). Extending Lattice Linearity for Self-stabilizing Algorithms. In: Johnen, C., Schiller, E.M., Schmid, S. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2021. Lecture Notes in Computer Science(), vol 13046. Springer, Cham. https://doi.org/10.1007/978-3-030-91081-5_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-91081-5_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-91080-8

  • Online ISBN: 978-3-030-91081-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics