Brief Announcement: Fully Lattice Linear Algorithms

被引：3
|
作者：
Gupta, Arya Tanmay [1 ]
Kulkarni, Sandeep S. [1 ]
机构：
[1] Michigan State Univ, Comp Sci & Engn, E Lansing, MI 48824 USA
来源：
STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS (SSS 2022) | 2022年 / 13751卷
关键词：
Self-stabilization; Lattice linear problems; Lattice linear algorithms; Minimal dominating set; Convergence time;
D O I：
10.1007/978-3-031-21017-4_24
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：341 / 345
页数：5
相关论文
共 50 条
  • [1] Brief Announcement: Fully Anonymous Shared Memory Algorithms
    Raynal, Michel
    Taubenfeld, Gadi
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2019, 2019, 11914 : 301 - 306
  • [2] Brief Announcement: Stateless Distributed Algorithms for Generalized Packing Linear Programs
    Awerbuch, Baruch
    Fu, Zhenghua
    Khandekar, Rohit
    PODC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2009, : 270 - 271
  • [3] Brief Announcement: Simple Gradecast Based Algorithms
    Ben-Or, Michael
    Dolev, Danny
    Hoch, Ezra N.
    DISTRIBUTED COMPUTING, 2010, 6343 : 194 - 197
  • [4] Brief Announcement: Optimal Distributed Covering Algorithms
    Ben-Basat, Ran
    Even, Guy
    Kawarabayashi, Ken-ichi
    Schwartzman, Gregory
    PROCEEDINGS OF THE 2019 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '19), 2019, : 104 - 106
  • [5] Brief announcement monitoring of linear distributed computations
    Esin, Anton
    Yavorskiy, Rostislav
    Zemtsov, Nikolay
    DISTRIBUTED COMPUTING, PROCEEDINGS, 2006, 4167 : 566 - 568
  • [6] Brief Announcement: A Platform for Experimenting with Mobile Algorithms in a Laboratory
    Killijian, Marc-Olivier
    Roy, Matthieu
    PODC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2009, : 316 - 317
  • [7] Brief Announcement: Reclaiming the Energy of a Schedule, Models and Algorithms
    Aupy, Guillaume
    Benoit, Anne
    Dufosse, Fanny
    Robert, Yves
    SPAA 11: PROCEEDINGS OF THE TWENTY-THIRD ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2011, : 135 - 136
  • [8] Brief announcement: Optimistic algorithms for partial database replication
    Schiper, Nicolas
    Schmidt, Rodrigo
    Pedone, Fernando
    DISTRIBUTED COMPUTING, PROCEEDINGS, 2006, 4167 : 557 - 559
  • [9] Brief Announcement: Multicore Paging Algorithms Cannot Be Competitive
    Kamali, Shahin
    Xu, Helen
    PROCEEDINGS OF THE 32ND ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA '20), 2020, : 547 - 549
  • [10] Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation
    Sarpatwar, Kanthi
    Schieber, Baruch
    Shachnai, Hadas
    SPAA'18: PROCEEDINGS OF THE 30TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2018, : 343 - 345
12345