Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Automating the Addition of Fault-Tolerance Sandeep S. Kulkarni Anish Arora
 

Summary: Automating the Addition of Fault-Tolerance
Sandeep S. Kulkarni Anish Arora
Department of Computer Department of Computer
Science and Engineering and Information Science
Michigan State University Ohio State University
East Lansing MI 48824 USA Columbus Ohio 43210 USA
Abstract
In this paper, we focus on automating the transformation of a given fault-intolerant
program into a fault-tolerant program. We show how such a transformation can be
done for three levels of fault-tolerance properties, failsafe, nonmasking and masking.
For the high atomicity model where the program can read all the variables and write
all the variables in one atomic step, we show that all three transformations can be
performed in polynomial time in the state space of the fault-intolerant program. For
the low atomicity model where restrictions are imposed on the ability of programs to
read and write variables, we show that all three transformations can be performed in
exponential time in the state space of the fault-intolerant program. We also show that
the the problem of adding masking fault-tolerance is NP-hard and, hence, exponential
complexity is inevitable unless P =NP .
1 Introduction
In this paper, we focus on automating the transformation of a fault-intolerant program

  

Source: Arora, Anish - Department of Computer Science and Engineering, Ohio State University

 

Collections: Computer Technologies and Information Sciences