Projekteja vuodessa
Abstrakti
The randomized online-LOCAL model captures a number of models of computing; it is at least as strong as all of these models:
- the classical LOCAL model of distributed graph algorithms,
- the quantum version of the LOCAL model,
- finitely dependent distributions [e.g. Holroyd 2016],
- any model that does not violate physical causality [Gavoille, Kosowski, Markiewicz, DISC 2009],
- the SLOCAL model [Ghaffari, Kuhn, Maus, STOC 2017], and
- the dynamic-LOCAL and online-LOCAL models [Akbari et al., ICALP 2023].
In general, the online-LOCAL model can be much stronger than the LOCAL model. For example, there are locally checkable labeling problems (LCLs) that can be solved with logarithmic locality in the online-LOCAL model but that require polynomial locality in the LOCAL model.
However, in this work we show that in trees, many classes of LCL problems have the same locality in deterministic LOCAL and randomized online-LOCAL (and as a corollary across all the above-mentioned models). In particular, these classes of problems do not admit any distributed quantum advantage.
We present a near-complete classification for the case of rooted regular trees. We also fully classify the super-logarithmic region in unrooted regular trees. Finally, we show that in general trees (rooted or unrooted, possibly irregular, possibly with input labels) problems that are global in deterministic LOCAL remain global also in the randomized online-LOCAL model.
- the classical LOCAL model of distributed graph algorithms,
- the quantum version of the LOCAL model,
- finitely dependent distributions [e.g. Holroyd 2016],
- any model that does not violate physical causality [Gavoille, Kosowski, Markiewicz, DISC 2009],
- the SLOCAL model [Ghaffari, Kuhn, Maus, STOC 2017], and
- the dynamic-LOCAL and online-LOCAL models [Akbari et al., ICALP 2023].
In general, the online-LOCAL model can be much stronger than the LOCAL model. For example, there are locally checkable labeling problems (LCLs) that can be solved with logarithmic locality in the online-LOCAL model but that require polynomial locality in the LOCAL model.
However, in this work we show that in trees, many classes of LCL problems have the same locality in deterministic LOCAL and randomized online-LOCAL (and as a corollary across all the above-mentioned models). In particular, these classes of problems do not admit any distributed quantum advantage.
We present a near-complete classification for the case of rooted regular trees. We also fully classify the super-logarithmic region in unrooted regular trees. Finally, we show that in general trees (rooted or unrooted, possibly irregular, possibly with input labels) problems that are global in deterministic LOCAL remain global also in the randomized online-LOCAL model.
Alkuperäiskieli | Englanti |
---|---|
Otsikko | 28th International Conference on Principles of Distributed Systems (OPODIS 2024) |
Toimittajat | Silvia Bonomi, Letterio Galletta, Etienne Rivière, Valerio Schiavoni |
Kustantaja | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
Sivut | 1-17 |
Sivumäärä | 17 |
ISBN (elektroninen) | 978-3-95977-360-7 |
DOI - pysyväislinkit | |
Tila | Julkaistu - 8 tammik. 2025 |
OKM-julkaisutyyppi | A4 Artikkeli konferenssijulkaisussa |
Tapahtuma | International Conference on Principles of Distributed Systems - IMT School for Advanced Studies Lucca, Lucca, Italia Kesto: 11 jouluk. 2024 → 13 jouluk. 2024 https://opodis2024.imtlucca.it/ |
Julkaisusarja
Nimi | Leibniz International Proceedings in Informatics (LIPIcs) |
---|---|
Kustantaja | Schloss Dagstuhl – Leibniz-Zentrum für Informatik |
Vuosikerta | 324 |
ISSN (elektroninen) | 1868-8969 |
Conference
Conference | International Conference on Principles of Distributed Systems |
---|---|
Lyhennettä | OPODIS |
Maa/Alue | Italia |
Kaupunki | Lucca |
Ajanjakso | 11/12/2024 → 13/12/2024 |
www-osoite |
Sormenjälki
Sukella tutkimusaiheisiin 'Local problems in trees across a wide range of distributed models'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.-
Limits of Causal Comp/Suomela: Limits of Causal Computation
Suomela, J. (Vastuullinen tutkija), Lievonen, H. (Projektin jäsen) & Equi, M. (Projektin jäsen)
01/01/2024 → 31/12/2026
Projekti: Academy of Finland: Other research funding
-
LocalMend /Suomela: Local Checking, Solving, and MendingNew Perspectives of Distributed Computing (LocalMend)
Suomela, J. (Vastuullinen tutkija), Lievonen, H. (Projektin jäsen), Melnyk, D. (Projektin jäsen), Vahidi, H. (Projektin jäsen), Studeny, J. (Projektin jäsen) & Akbari, A. (Projektin jäsen)
01/09/2020 → 31/08/2024
Projekti: Academy of Finland: Other research funding