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 条
  • [31] Brief Announcement: Region-Adherent Algorithms - Bounding the Impact of Faults in Space
    Becker, Jan Steffen
    Rahmatov, Dilshod
    Theel, Oliver
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2014, 2014, 8756 : 362 - 365
  • [32] Brief Announcement: Locality-enhancing Loop Transformations for Tree Traversal Algorithms
    Jo, Youngjoon
    Kulkarni, Milind
    SPAA 11: PROCEEDINGS OF THE TWENTY-THIRD ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2011, : 263 - 264
  • [33] Brief Announcement: Efficient Distributed Algorithms for the K-Nearest Neighbors Problem
    Fathi, Reza
    Molla, Anisur Rahaman
    Pandurangan, Gopal
    PROCEEDINGS OF THE 32ND ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA '20), 2020, : 527 - 529
  • [34] Brief announcement: Region-Adherent algorithms – bounding the impact of faults in space
    1600, Springer Verlag (8756):
  • [35] Brief Announcement: Energy-Optimal Distributed Algorithms for Minimum Spanning Trees
    Choi, Yongwook
    Khan, Maleq
    Kumar, V. S. Anil
    Pandurangan, Gopal
    SPAA'08: PROCEEDINGS OF THE TWENTIETH ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2008, : 188 - +
  • [36] Brief Announcement: Distributed Algorithms for Maximum Link Scheduling in the Physical Interference Model
    Pei, Guanhong
    Vullikanti, Anil Kumar S.
    DISTRIBUTED COMPUTING, DISC 2012, 2012, 7611 : 407 - +
  • [37] Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale
    Bjelde, Antje
    Klimm, Max
    Schmand, Daniel
    PROCEEDINGS OF THE 29TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA'17), 2017, : 227 - 229
  • [38] Brief announcement.
    Alexander, S
    DEUTSCHE MEDIZINISCHE WOCHENSCHRIFT, 1928, 54 : 1261 - 1261
  • [39] Brief Announcement: Are Lock-Free Concurrent Algorithms Practically Wait-Free?
    Alistarh, Dan
    Censor-Hillel, Keren
    Shavit, Nir
    PROCEEDINGS OF THE 2014 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'14), 2014, : 50 - 52
  • [40] Brief Announcement: On the I/O Complexity of Sequential and Parallel Hybrid Integer Multiplication Algorithms
    De Stefani, Lorenzo
    PROCEEDINGS OF THE 34TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2022, 2022, : 449 - 452
12345