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 条
  • [41] Brief Announcement: Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension
    Hinnenthal, Kristian
    Scheideler, Christian
    Struijs, Martijn
    SPAA'19: PROCEEDINGS OF THE 31ST ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURESS, 2019, 2019, : 393 - 394
  • [42] Brief Announcement: PARLAYLIB - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines
    Blelloch, Guy E.
    Anderson, Daniel
    Dhulipala, Laxman
    PROCEEDINGS OF THE 32ND ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA '20), 2020, : 507 - 509
  • [43] Brief Announcement: Efficient Approximation Algorithms for Computing k Disjoint Restricted Shortest Paths
    Guo, Longkun
    Liao, Kewen
    Shen, Hong
    Li, Peng
    SPAA'15: PROCEEDINGS OF THE 27TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2015, : 62 - 64
  • [44] Brief Announcement: Fast and Better Distributed MapReduce Algorithms for k-Center Clustering
    Im, Sungjin
    Moseley, Benjamin
    SPAA'15: PROCEEDINGS OF THE 27TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2015, : 65 - 67
  • [45] RECURSIVE MATCHING ALGORITHMS AND LINEAR ORDERS ON SUBSET LATTICE
    WHITE, DE
    WILLIAMSON, SG
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 1977, 23 (02) : 117 - 127
  • [46] COMPUTATIONAL ALGORITHMS FOR LINEAR-CONTROL SYSTEMS - A BRIEF SURVEY
    PETKOV, PH
    KONSTANTINOV, MM
    CHRISTOV, ND
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 1985, 16 (04) : 465 - 477
  • [47] Brief Announcement: On Site Fidelity and the Price of Ignorance in Swarm Robotic Central Place Foraging Algorithms
    Aggarwal, Abhinav
    Matthew Fricke, G.
    Gupta, Diksha
    Moses, Melanie E.
    PROCEEDINGS OF THE 2019 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '19), 2019, : 63 - 65
  • [48] Brief Announcement: Reduced Space Self-stabilizing Center Finding Algorithms in Chains and Trees
    Sudo, Yuichi
    Datta, Ajoy K.
    Larmore, Lawrence L.
    Masuzawa, Toshimitsu
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2017, 2018, 10616 : 303 - 307
  • [49] Brief Announcement: Scheduling Jobs for Minimum Span: Improved Bounds and Learning-Augmented Algorithms
    Liu, Mozhengfu
    Tang, Xueyan
    PROCEEDINGS OF THE 36TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2024, 2024, : 141 - 143
  • [50] Brief Announcement: Communication-Efficient Weighted Reservoir Sampling from Fully Distributed Data Streams
    Huebschle-Schneider, Lorenz
    Sanders, Peter
    PROCEEDINGS OF THE 32ND ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA '20), 2020, : 543 - 545
12345