Fault-Tolerant Parallel Computation / Edition 1

by Paris Christos Kanellakis, Alex Allister Shvartsman

Overview

Fault-Tolerant Parallel Computation presents recent advances in algorithmic ways of introducing fault-tolerance in multiprocessors under the constraint of preserving efficiency. The difficulty associated with combining fault-tolerance and efficiency is that the two have conflicting means: fault-tolerance is achieved by introducing redundancy, while efficiency is achieved by removing redundancy. This monograph demonstrates how in certain models of parallel computation it is possible to combine efficiency and fault-tolerance and shows how it is possible to develop efficient algorithms without concern for fault-tolerance, and then correctly and efficiently execute these algorithms on parallel machines whose processors are subject to arbitrary dynamic fail-stop errors. The efficient algorithmic approaches to multiprocessor fault-tolerance presented in this monograph make a contribution towards bridging the gap between the abstract models of parallel computation and realizable parallel architectures.
Fault-Tolerant Parallel Computation presents the state of the art in algorithmic approaches to fault-tolerance in efficient parallel algorithms. The monograph synthesizes work that was presented in recent symposia and published in refereed journals by the authors and other leading researchers. This is the first text that takes the reader on the grand tour of this new field summarizing major results and identifying hard open problems. This monograph will be of interest to academic and industrial researchers and graduate students working in the areas of fault-tolerance, algorithms and parallel computation and may also be used as a text in a graduate course on parallel algorithmic techniques and fault-tolerance.

Product Details

ISBN-13:	9780792399223
Publisher:	Springer US
Publication date:	05/31/1997
Series:	The Springer International Series in Engineering and Computer Science , #401
Edition description:	1997
Pages:	183
Product dimensions:	6.10(w) x 9.25(h) x 0.36(d)

Table of Contents

1 Introduction.- 2 Models for Robust Computation.- 3 The Write-All Problem: Algorithms.- 4 Lower Bounds, Snapshots and Approximation.- 5 Fault-Tolerant Simulations.- 6 Shared Memory Randomized Algorithms and Distributed Models and Algorithms.- Bibliography and References.- Author Index.

Editorial Reviews

In full awareness of the difficulty that fault-tolerance requires increasing redundancy while efficiency requires reducing it, present recent advances in combining the reliability potential of replicated processors in distributed systems with the speed potential of parallel computation. Presents general fault- tolerant algorithm simulations and transformation techniques, and surveys relevant recent results for asynchronous and randomized computation and for the message-passing model of computation. Annotation c. by Book News, Inc., Portland, Or.

Booknews