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

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Chlebus, Bogdan S, Gąsieniec, Leszek, Kowalski, Dariusz R, Schwarzmann, Alexander A
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 19.07.2018
Subjects:	Algorithms Communication Complexity Crashes Lower bounds Message passing Microprocessors Processors
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!