### Abstract

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 workcomplexity and communication complexity. 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+plogp(plogp+tlogt)) and a nonconstructive algorithm that has work O(t+plog^{2}p). The latter result is close to the lower bound Ω(t+plogp/loglogp) 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}).

Original language | English (US) |
---|---|

Pages (from-to) | 1-40 |

Number of pages | 40 |

Journal | Information and Computation |

Volume | 254 |

DOIs | |

State | Published - Jun 1 2017 |

Externally published | Yes |

### Keywords

- Crash failures
- Distributed algorithm
- Load balancing
- Message passing
- Ramanujan graphs
- Scheduling tasks

### ASJC Scopus subject areas

- Theoretical Computer Science
- Information Systems
- Computer Science Applications
- Computational Theory and Mathematics

## Fingerprint Dive into the research topics of 'Doing-it-All with bounded work and communication'. Together they form a unique fingerprint.

## Cite this

*Information and Computation*,

*254*, 1-40. https://doi.org/10.1016/j.ic.2017.02.003