Constant space and non-constant time in distributed computing

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussavertaisarvioitu

Tutkijat

Organisaatiot

Kuvaus

While the relationship of time and space is an established topic in traditional centralised complexity theory, this is not the case in distributed computing. We aim to remedy this by studying the time and space complexity of algorithms in a weak message-passing model of distributed computing. While a constant number of communication rounds implies a constant number of states visited during the execution, the other direction is not clear at all. We consider several graph families and show that indeed, there exist non-trivial graph problems that are solvable by constant-space algorithms but that require a non-constant running time. This provides us with a new complexity class for distributed computing and raises interesting questions about the existence of further combinations of time and space complexity.

Yksityiskohdat

AlkuperäiskieliEnglanti
Otsikko21st International Conference on Principles of Distributed Systems (OPODIS 2017)
TilaJulkaistu - maaliskuuta 2018
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisuussa
TapahtumaInternational Conference on Principles of Distributed Systems - Lisbon, Portugali
Kesto: 18 joulukuuta 201720 joulukuuta 2017
Konferenssinumero: 21

Julkaisusarja

NimiLeibniz International Proceedings in Informatics
KustantajaSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH
Vuosikerta95
ISSN (elektroninen)1868-8969

Conference

ConferenceInternational Conference on Principles of Distributed Systems
LyhennettäOPODIS
MaaPortugali
KaupunkiLisbon
Ajanjakso18/12/201720/12/2017

ID: 16461876