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

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Chlebus, Bogdan S, Gąsieniec, Leszek, Kowalski, Dariusz R, Schwarzmann, Alexander A
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 19.07.2018
Predmet:	Algorithms Communication Complexity Crashes Lower bounds Message passing Microprocessors Processors
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!