We survey results from distributed computing that show tasks to be impossible, either
outright or within given resource bounds, in various models. The parameters of the models …

A major challenge for computer science in the 1990s is to determine the extent to which
general purpose parallel computing can be achieved. The goal is to deliver both scalable …

The efficient parallel algorithms proposed for many fundamental problems, such as list
ranking, computing preorder numberings and other functions on trees, or integer sorting, are …

We consider a system oft synchronous processes that communicate only by sending
messages to one another, and that together must perform n independent units of work …

Fault-Tolerant Parallel Computation presents recent advances in algorithmic ways of
introducing fault-tolerance in multiprocessors under the constraint of preserving efficiency …

MapReduce is often used to run critical jobs such as scientific data analysis. However,
evidence in the literature shows that arbitrary faults do occur and can probably corrupt the …

We study the problem of executing parallel programs, in particular Cilk programs, on a
collection of processors of different speeds. We consider a model in which each processor …

The authors consider the tolerance of data structures to memory faults. They observe that
many pointer-based data structures (eg linked lists, trees, etc.) are highly nonresilient to …

The importance of adapting networks of workstations for use as parallel processing
platforms is well established. However current solutions do not always address important …

We introduce a theory of competitive analysis for distributed algorithms. The first steps in this
direction were made in the seminal papers of Y. Bartal et al.(1992), and of B. Awerbuch et …