Enhancing The Fault-Tolerance of Nonmasking Programs

In this paper, we focus on automated techniques to enhance the fault-tolerance of a nonmasking fault-tolerant program to masking. A masking program continually satisfies its specification even if faults occur. By contrast, a nonmasking program merely guarantees that after faults stop occurring, the program recovers to states from where it continually satisfies its specification. Until the recovery is complete, however, a nonmasking program can violate its (safety) specification. Thus, the problem of enhancing fault-tolerance from nonmasking to masking requires that safety be added and recovery be preserved. We focus on this enhancement problem for high atomicity programs –where each process can read all variables– and for distributed programs –where restrictions are imposed on what processes can read and write. We present a sound and complete algorithm for high atomicity programs and a sound algorithm for distributed programs. We also argue that our algorithms are simpler t...

• Type: Conference
• Year: 2003
• Where: ICDCS
• Authors: Sandeep S. Kulkarni, Ali Ebnenasir
• Keywords: Distributed And Parallel Computing, Fault-tolerance, ICDCS 2003, Nonmasking Fault-tolerant Program, Nonmasking Program