Transparent Fault-Tolerance In Parallel Orca Programs

With the advent of large-scale parallel computing systems, making parallel programs fault-tolerant becomes an important problem, because the probability of a failure increases with the number of processors. In this paper, we describe a very simple scheme for rendering a class of parallel Orca progra...

Full description

Bibliographic Details
Main Authors: M. Frans Kaashoek, Raymond Michiels, Henri E. Bal, Andrew S. Tanenbaum
Other Authors: The Pennsylvania State University CiteSeerX Archives
Format: Text
Language:English
Published: 1992
Subjects:
Online Access:http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.4237
Description
Summary:With the advent of large-scale parallel computing systems, making parallel programs fault-tolerant becomes an important problem, because the probability of a failure increases with the number of processors. In this paper, we describe a very simple scheme for rendering a class of parallel Orca programs fault-tolerant. Also, we discuss our experience with implementing this scheme on Amoeba. Our approach works for parallel applications that are not interactive. The approach is based on making a globally consistent checkpoint from time to time and rolling back to the last checkpoint when a processor fails. Making a consistent global checkpoint is easy in Orca, because its implementation is based on reliable broadcast. The advantages of our approach are its simplicity, ease of implementation, low overhead, and transparency to the Orca programmer. 1. INTRODUCTION Designers of parallel languages frequently ignore fault tolerance. If one of the processors on which a parallel program runs cras.