License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.OPODIS.2022.20
URN: urn:nbn:de:0030-drops-176401
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/17640/
Fraigniaud, Pierre ;
Montealegre, Pedro ;
Paredes, Pablo ;
Rapaport, Ivan ;
Ríos-Wilson, Martín ;
Todinca, Ioan
Computing Power of Hybrid Models in Synchronous Networks
Abstract
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. The separation results are obtained by approaching communication complexity through an original angle, which may be of an independent interest. The two players are not bounded to compute the value of a binary function, but the combined outputs of the two players are constrained by this value. In particular, we introduce the XOR-Index problem, in which Alice is given a binary vector x ∈ {0,1}ⁿ together with an index i ∈ [n], Bob is given a binary vector y ∈ {0,1}ⁿ together with an index j ∈ [n], and, after a single round of 2-way communication, Alice must output a boolean out_A, and Bob must output a boolean out_B, such that out_A ∧ out_B = x_j⊕ y_i. We show that the communication complexity of XOR-Index is Ω(n) bits.
BibTeX - Entry
@InProceedings{fraigniaud_et_al:LIPIcs.OPODIS.2022.20,
author = {Fraigniaud, Pierre and Montealegre, Pedro and Paredes, Pablo and Rapaport, Ivan and R{\'\i}os-Wilson, Mart{\'\i}n and Todinca, Ioan},
title = {{Computing Power of Hybrid Models in Synchronous Networks}},
booktitle = {26th International Conference on Principles of Distributed Systems (OPODIS 2022)},
pages = {20:1--20:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-265-5},
ISSN = {1868-8969},
year = {2023},
volume = {253},
editor = {Hillel, Eshcar and Palmieri, Roberto and Rivi\`{e}re, Etienne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/17640},
URN = {urn:nbn:de:0030-drops-176401},
doi = {10.4230/LIPIcs.OPODIS.2022.20},
annote = {Keywords: hybrid model, synchronous networks, LOCAL, CONGEST, Broadcast Congested Clique}
}
|
Keywords: |
|
hybrid model, synchronous networks, LOCAL, CONGEST, Broadcast Congested Clique |
|
Collection: |
|
26th International Conference on Principles of Distributed Systems (OPODIS 2022) |
|
Issue Date: |
|
2023 |
|
Date of publication: |
|
15.02.2023 |
