Fault Tolerant Cluster Computing through Replication
Conference Proceeding Article
Long-lived parallel applications running on work station clusters are vulnerable to single-node or multiple-node failures. Fault recovery is therefore required to prevent immature program termination. However, much of the runtime overhead imposed by fault tolerance schemes is generally due to the cost of transferring the checkpoint states of applications by disk I/O operations. In this paper, we propose a fault tolerant model in which checkpoint states are transferred between replicated parallel applications. We also describe how the resource consumption of the replicated applications can be minimized. The fault tolerant model has been implemented and tested on a workstation cluster and a Fujitsu AP3000 multi-processor machine. The measurements of our experiments have showed that efficient fault tolerance can be achieved by replicating parallel applications on clusters of computers.
Databases and Information Systems | Numerical Analysis and Scientific Computing
Data Management and Analytics
ICPADS '97: Proceedings of the 1997 International Conference on Parallel and Distributed Systems
City or Country
SHUM, Kam Hong.
Fault Tolerant Cluster Computing through Replication. (1997). ICPADS '97: Proceedings of the 1997 International Conference on Parallel and Distributed Systems. 756-763. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1053
This document is currently not available here.