Doing-it-All with Bounded Work and Communication

Bogdan S. Chlebus, Leszek Gąsieniec, Dariusz R. Kowalski +1

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 messa…