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 measured i...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information and computation Jg. 254; S. 1 - 40
Hauptverfasser:	Chlebus, Bogdan S., Gąsieniec, Leszek, Kowalski, Dariusz R., Schwarzmann, Alexander A.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.06.2017
Schlagworte:	Crash failures Distributed algorithm Load balancing Message passing Ramanujan graphs Scheduling tasks Ramanujan graphs Message passing Scheduling tasks Crash failures Load balancing Distributed algorithm
ISSN:	0890-5401, 1090-2651
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!