Doing-it-All with Bounded Work and Communication

We consider the Do-All problem, where \(p\) cooperating processors need to complete \(t\) similar and independent tasks in an adversarial setting. Here we deal with a synchronous message passing system with processors that are subject to crash failures. Efficiency of algorithms in this setting is me...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:arXiv.org
Hlavní autoři: Chlebus, Bogdan S, Gąsieniec, Leszek, Kowalski, Dariusz R, Schwarzmann, Alexander A
Médium: Paper
Jazyk:angličtina
Vydáno: Ithaca Cornell University Library, arXiv.org 19.07.2018
Témata:
Algorithms
Communication
Complexity
Crashes
Lower bounds
Message passing
Microprocessors
Processors
ISSN:2331-8422
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We consider the Do-All problem, where \(p\) cooperating processors need to complete \(t\) similar and independent tasks in an adversarial setting. Here we deal with a synchronous message passing system with processors that are subject to crash failures. Efficiency of algorithms in this setting is measured in terms of work complexity (also known as total available processor steps) and communication complexity (total number of point-to-point messages). When work and communication are considered to be comparable resources, then the overall efficiency is meaningfully expressed in terms of effort defined as work + communication. We develop and analyze a constructive algorithm that has work \(O( t + p \log p\, (\sqrt{p\log p}+\sqrt{t\log t}\, ) )\) and a nonconstructive algorithm that has work \(O(t +p \log^2 p)\). The latter result is close to the lower bound \(\Omega(t + p \log p/ \log \log p)\) on work. The effort of each of these algorithms is proportional to its work when the number of crashes is bounded above by \(c\,p\), for some positive constant \(c < 1\). We also present a nonconstructive algorithm that has effort \(O(t + p ^{1.77})\).
Bibliografie:SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
ISSN:2331-8422
DOI:10.48550/arxiv.1409.4711