Fault-Tolerant Parallel Computation

Fault-Tolerant Parallel Computation by Paris Christos Kanellakis, Alex Allister Shvartsman.

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-tole...

Full description

Saved in:
Bibliographic Details
Main Authors: Kanellakis, Paris Christos (Author), Shvartsman, Alex Allister (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: New York, NY : Springer US : Imprint: Springer, 1997.
Edition:1st ed. 1997.
Series:The Springer International Series in Engineering and Computer Science, 401
Springer eBook Collection.
Subjects:
Computers.
Microprocessors.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
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.

Similar Items