Tolerance to Asynchrony in Algorithms for Multiplication and Modulo
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916438935076864 |
|---|---|
| author | Gupta, Arya Tanmay Kulkarni, Sandeep S |
| author_facet | Gupta, Arya Tanmay Kulkarni, Sandeep S |
| contents | In this article, we study some parallel processing algorithms for multiplication and modulo operations. We demonstrate that the state transitions that are formed under these algorithms satisfy lattice-linearity, where these algorithms induce a lattice among the global states. Lattice-linearity implies that these algorithms can be implemented in asynchronous environments, where the nodes are allowed to read old information from each other. It means that these algorithms are guaranteed to converge correctly without any synchronization overhead. These algorithms also exhibit snap-stabilizing properties, i.e., starting from an arbitrary state, the sequence of state transitions made by the system strictly follows its specification. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2302_07207 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Tolerance to Asynchrony in Algorithms for Multiplication and Modulo Gupta, Arya Tanmay Kulkarni, Sandeep S Distributed, Parallel, and Cluster Computing In this article, we study some parallel processing algorithms for multiplication and modulo operations. We demonstrate that the state transitions that are formed under these algorithms satisfy lattice-linearity, where these algorithms induce a lattice among the global states. Lattice-linearity implies that these algorithms can be implemented in asynchronous environments, where the nodes are allowed to read old information from each other. It means that these algorithms are guaranteed to converge correctly without any synchronization overhead. These algorithms also exhibit snap-stabilizing properties, i.e., starting from an arbitrary state, the sequence of state transitions made by the system strictly follows its specification. |
| title | Tolerance to Asynchrony in Algorithms for Multiplication and Modulo |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2302.07207 |