The Complexity of Synchronous Iterative Do-All with Crashes

Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to distributed simulation and multi-agent collaboration. Doabstraction of such cooperative activity, is the problem of performing N tasks in a distributed system of P failureprone processors. Many distributed and parallel algorithms have been developed for this problem and several algorithm simulations have been developed by iterating Do-All algorithms. The efficiency of the solutions for Do-All is measured in terms of work complexity where all processing steps taken by all processors are counted. Work is ideally expressed as a function of N, P, and f, the number of processor crashes. However the known lower bounds and the upper bounds for extant algorithms do not adequately show how work depends on f. We present the first non-trivial lower bounds for Do-All that capture the dependence of work on N, P and f. F...

• Type: Conference
• Year: 2001
• Where: WDAG
• Authors: Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
• Keywords: Algorithms, Do-All Algorithms, Lower Bounds, Upper Bounds, WDAG 2001