Work-competitive scheduling for cooperative computing with dynamic groups

The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distributed computing. The setting with partitionable networks is especially challenging, as algorithmic solutions must accommodate the possibility that groups of processors become disconnected (and, perhaps, reconnected) during the computation. The efficiency of task-performing algorithms is often assessed in terms of their work: the total number of tasks, counting multiplicities, performed by all of the processors during the computation. In general, an adversary that is able to partition the network into g components can cause any task-performing algorithm to have work (t ? g) even if each group of processors performs no more than the optimal number of (t) tasks. Given such pessimistic lower bounds, and in order to understand better the practical implications of performing work in partitionable settings, we study ...

• Type: Conference
• Year: 2003
• Where: STOC
• Authors: Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
• Keywords: Algorithms, NSF Career Award, NSF ITR Grant, Simple Randomized Algorithm, STOC 2003