eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2022-10-17
43:1
43:3
10.4230/LIPIcs.DISC.2022.43
article
Brief Announcement: Computing Power of Hybrid Models in Synchronous Networks
Fraigniaud, Pierre
1
Montealegre, Pedro
2
Paredes, Pablo
3
Rapaport, Ivan
4
Ríos-Wilson, Martín
2
Todinca, Ioan
5
6
IRIF, Université Paris Cité and CNRS, France
Faculty of Engineering and Science, Universidad Adolfo Ibáñez, Santiago, Chile
Department of Mathematical Engineering, University of Chile, Santiago, Chile
DIM-CMM (UMI 2807 CNRS), University of Chile, Santiago, Chile
LIFO, Université d'Orléans, France
INSA Centre-Val de Loire, Bourges, France
During the last two decades, a small set of distributed computing models for networks have emerged, among which LOCAL, CONGEST, and Broadcast Congested Clique (BCC) play a prominent role. We consider hybrid models resulting from combining these three models. That is, we analyze the computing power of models allowing to, say, perform a constant number of rounds of CONGEST, then a constant number of rounds of LOCAL, then a constant number of rounds of BCC, possibly repeating this figure a constant number of times. We specifically focus on 2-round models, and we establish the complete picture of the relative powers of these models. That is, for every pair of such models, we determine whether one is (strictly) stronger than the other, or whether the two models are incomparable.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol246-disc2022/LIPIcs.DISC.2022.43/LIPIcs.DISC.2022.43.pdf
hybrid model
synchronous networks
LOCAL
CONGEST
Broadcast Congested Clique