Skip to main content
Springer Nature Link
Log in

Brief Announcement: Fully Lattice Linear Algorithms

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

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13751))

Abstract

This paper focuses on analyzing and differentiating between lattice linear problems and lattice linear algorithms. It introduces a new class of algorithms called (fully) lattice linear algorithms, that induce a partial order among all states and form multiple lattices. An initial state locks the system into one of these lattices. We present a lattice linear self-stabilizing algorithm for minimal dominating set.

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. 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  MATH  Google Scholar 

  2. Garg, V.K.: Predicate Detection to Solve Combinatorial Optimization Problems. In: Association for Computing Machinery, pp. 235–245. New York (2020)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. Gupta, A.T., Kulkarni, S.S.: Extending lattice linearity for self-stabilizing algorithms. In: Johnen, C., Schiller, E.M., Schmid, S. (eds.) SSS 2021. LNCS, vol. 13046, pp. 365–379. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-91081-5_24

    Chapter  Google Scholar 

  5. Gupta, A.T., Kulkarni, S.S.: Lattice linear algorithms. CoRR abs/2209.14703, 2022

    Google Scholar 

  6. 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 Picardie Jules Verne, Amiens, France

    Stéphane Devismes

  2. Sorbonne University, Paris, France

    Franck Petit

  3. Grenoble Alpes University, Saint-Martin-d'Hères, France

    Karine Altisen

  4. Sapienza University of Rome, Rome, Italy

    Giuseppe Antonio Di Luna

  5. IMDEA Networks Institute, Madrid, Spain

    Antonio Fernandez Anta

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to 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. (2022). Brief Announcement: Fully Lattice Linear Algorithms. In: Devismes, S., Petit, F., Altisen, K., Di Luna, G.A., Fernandez Anta, A. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2022. Lecture Notes in Computer Science, vol 13751. Springer, Cham. https://doi.org/10.1007/978-3-031-21017-4_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-21017-4_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-21016-7

  • Online ISBN: 978-3-031-21017-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics