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 条
  • [21] Brief Announcement: Complete Visibility for Oblivious Robots in Linear Time
    Sharma, Gokarna
    Busch, Costas
    Mukhopadhyay, Supratik
    PROCEEDINGS OF THE 29TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA'17), 2017, : 325 - 327
  • [22] Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear
    El-Hayek, Antoine
    Henzinger, Monika
    Schmid, Stefan
    PROCEEDINGS OF THE 2022 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, PODC 2022, 2022, : 54 - 56
  • [23] Brief Announcement: Balanced Partitioning of Several Cache-Oblivious Algorithms
    Tang, Yuan
    PROCEEDINGS OF THE 32ND ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA '20), 2020, : 575 - 577
  • [24] Brief Announcement: Acceleration by Contention for Shared Memory Mutual Exclusion Algorithms
    Inoue, Michiko
    Suzuki, Tsuyoshi
    Fujiwara, Hideo
    DISTRIBUTED COMPUTING, PROCEEDINGS, 2009, 5805 : 172 - 173
  • [25] Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond
    Chitnis, Rajesh
    Cormode, Graham
    Esfandiari, Hossein
    MohammadTaghi
    Monemizadeh, Morteza
    SPAA'15: PROCEEDINGS OF THE 27TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2015, : 56 - 58
  • [26] Uzawa Algorithms for Fully Fuzzy Linear Systems
    H. Zareamoghaddam
    A. T. Chronopoulos
    M. Nouri Kadijani
    Z. Zareamoghaddam
    International Journal of Computational Intelligence Systems, 2016, 9 : 971 - 983
  • [27] Uzawa Algorithms for Fully Fuzzy Linear Systems
    Zareamoghaddam, H.
    Chronopoulos, A. T.
    Kadijani, M. Nouri
    Zareamoghaddam, Z.
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2016, 9 (05) : 971 - 983
  • [28] Uzawa Algorithms for Fully Fuzzy Linear Systems
    Zareamoghaddam, H.
    Chronopoulos, A.T.
    Kadijani, M. Nouri
    Zareamoghaddam, Z.
    International Journal of Computational Intelligence Systems, 2016, 9 (05): : 971 - 983
  • [29] Brief Announcement: Gathering Despite a Linear Number of Weakly Byzantine Agents
    Hirose, Jion
    Nakamura, Junya
    Ooshita, Fukuhito
    Inoue, Michiko
    PROCEEDINGS OF THE 2022 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, PODC 2022, 2022, : 375 - 377
  • [30] Brief Announcement: Local Computation Algorithms for Graphs of Non-Constant Degrees
    Levi, Reut
    Rubinfeld, Ronitt
    Yodpinyanee, Anak
    SPAA'15: PROCEEDINGS OF THE 27TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2015, : 59 - 61
12345