Fully Lattice Linear Algorithms
Distributed, Parallel, and Cluster Computing
2022-11-11 v3 Data Structures and Algorithms
Abstract
This paper focuses on analyzing and differentiating between lattice linear problems and algorithms. It introduces a new class of algorithms called \textit{(fully) lattice linear algorithms}. A property of these algorithms is that they induce a partial order among all states and form \textit{multiple lattices}. An initial state locks in one of these lattices. We present a lattice linear self-stabilizing algorithm for minimal dominating set.
Cite
@article{arxiv.2209.14703,
title = {Fully Lattice Linear Algorithms},
author = {Arya Tanmay Gupta and Sandeep S Kulkarni},
journal= {arXiv preprint arXiv:2209.14703},
year = {2022}
}