Fault-Tolerant Parallel Computation

Author:   Paris Christos Kanellakis ,  Alex Allister Shvartsman
Publisher:   Springer-Verlag New York Inc.
Edition:   Softcover reprint of hardcover 1st ed. 1997
Volume:   401
ISBN:  

9781441951779


Pages:   183
Publication Date:   01 December 2010
Format:   Paperback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $472.56 Quantity:  
Add to Cart

Share |

Fault-Tolerant Parallel Computation


Add your own review!

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.

Full Product Details

Author:   Paris Christos Kanellakis ,  Alex Allister Shvartsman
Publisher:   Springer-Verlag New York Inc.
Imprint:   Springer-Verlag New York Inc.
Edition:   Softcover reprint of hardcover 1st ed. 1997
Volume:   401
Dimensions:   Width: 15.50cm , Height: 1.10cm , Length: 23.50cm
Weight:   0.454kg
ISBN:  

9781441951779


ISBN 10:   1441951776
Pages:   183
Publication Date:   01 December 2010
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

ARG20253

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List