Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.00247 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929693543890944 |
|---|---|
| author | Rasheed, Abdullah Dubagunta, Nidhi |
| author_facet | Rasheed, Abdullah Dubagunta, Nidhi |
| contents | This paper studies the lattice agreement problem and proposes a stronger form, $\varepsilon$-bounded lattice agreement, that enforces an additional tightness constraint on the outputs. To formalize the concept, we define a quasi-metric on the structure of the lattice, which captures a natural notion of distance between lattice elements. We consider the bounded lattice agreement problem in both synchronous and asynchronous systems, and provide algorithms that aim to minimize the distance between the output values, while satisfying the requirements of the classic lattice agreement problem. We show strong impossibility results for the asynchronous case, and a heuristic algorithm that achieves improved tightness with high probability, and we test an approximation of this algorithm to show that only a very small number of rounds are necessary. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_00247 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Bounding Distance Between Outputs in Distributed Lattice Agreement Rasheed, Abdullah Dubagunta, Nidhi Distributed, Parallel, and Cluster Computing This paper studies the lattice agreement problem and proposes a stronger form, $\varepsilon$-bounded lattice agreement, that enforces an additional tightness constraint on the outputs. To formalize the concept, we define a quasi-metric on the structure of the lattice, which captures a natural notion of distance between lattice elements. We consider the bounded lattice agreement problem in both synchronous and asynchronous systems, and provide algorithms that aim to minimize the distance between the output values, while satisfying the requirements of the classic lattice agreement problem. We show strong impossibility results for the asynchronous case, and a heuristic algorithm that achieves improved tightness with high probability, and we test an approximation of this algorithm to show that only a very small number of rounds are necessary. |
| title | Bounding Distance Between Outputs in Distributed Lattice Agreement |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2502.00247 |