.png){kind=icon}
.png){kind=icon}
Return
HOMOTOPY THEORY AND DISTRIBUTED COMPUTING
.png){kind=icon}
PRE
AI
DOI：10.3934/fods.2026011.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Algebraic topology has proved to be a very useful tool in addressing the computability of rendezvous problems in distributed computing. To date, the tools used include the fundamental group and ordinary homology. This paper introduces more sophisticated techniques from homotopy theory involving the Hilton-Milnor theorem in order to analyze whether rendezvous problems are solvable. A criterion is proved that ensures a solution given certain hypotheses. Families of examples are given when the hypotheses are satisfied and when they are not satisfied; these include new cases when homology alone suffices to ensure a solution, and cases when homology needs to be supplemented by additional properties to obtain a solution.
Keywords:
Distributed computing
rendezvous task
homotopy theory
geometric realization
Journal
F
IF:
1.4
Papers:
17
Citations:
0