Fault-tolerant Parallel Computation

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.