Fault-Tolerant Parallel Computation

Author:   Paris Christos Kanellakis ,  Alex Allister Shvartsman
Publisher:   Springer
Edition:   1997 ed.
Volume:   401
ISBN:  

9780792399223


Pages:   183
Publication Date:   31 May 1997
Format:   Hardback
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

This text 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. It also 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. The monograph synthesizes work that was presented in recent symposia and published in refereed journals by the authors and other leading researchers.

Full Product Details

Author:   Paris Christos Kanellakis ,  Alex Allister Shvartsman
Publisher:   Springer
Imprint:   Springer
Edition:   1997 ed.
Volume:   401
Dimensions:   Width: 15.50cm , Height: 1.40cm , Length: 23.50cm
Weight:   1.080kg
ISBN:  

9780792399223


ISBN 10:   0792399226
Pages:   183
Publication Date:   31 May 1997
Audience:   College/higher education ,  Professional and scholarly ,  Undergraduate ,  Postgraduate, Research & Scholarly
Format:   Hardback
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

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List