Skip to main content
SpringerLink
Log in
Book cover

Fault-Tolerant Parallel Computation

  • Book
  • © 1997

Overview

Authors:
  1. Paris Christos Kanellakis

    1. Brown University, Providence, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Alex Allister Shvartsman

    1. Massachusetts Institute of Technology, Cambridge, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: The Springer International Series in Engineering and Computer Science (SECS, volume 401)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (6 chapters)

  1. Front Matter

    Pages i-xxix
    Download chapter PDF

  2. Introduction

    • Paris Christos Kanellakis, Alex Allister Shvartsman
    Pages 1-18

  3. Models for Robust Computation

    • Paris Christos Kanellakis, Alex Allister Shvartsman
    Pages 19-45

  4. The Write-All Problem: Algorithms

    • Paris Christos Kanellakis, Alex Allister Shvartsman
    Pages 47-114

  5. Lower Bounds, Snapshots and Approximation

    • Paris Christos Kanellakis, Alex Allister Shvartsman
    Pages 115-130

  6. Fault-Tolerant Simulations

    • Paris Christos Kanellakis, Alex Allister Shvartsman
    Pages 131-157

  7. Shared Memory Randomized Algorithms and Distributed Models and Algorithms

    • Paris Christos Kanellakis, Alex Allister Shvartsman
    Pages 159-167

  8. Back Matter

    Pages 169-183
    Download chapter PDF
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • Brown University, Providence, USA

    Paris Christos Kanellakis

  • Massachusetts Institute of Technology, Cambridge, USA

    Alex Allister Shvartsman

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation