Designing fault tolerant application in Maruti

Author

Liang, Deron ; Agrawala, Ashok ; Mosse, Danniel ; Shi, Yiheng

Author_Institution

Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA

fYear

1992

fDate

7-10 Oct 1992

Firstpage

264

Lastpage

273

Abstract

A model is given for developing application with fault-tolerance requirements and real-time constraints. Applications in this model are specified using computation graphs, in which vertices represent tasks and arcs represent precedence constraints. Tasks are replicated to provide required fault tolerance and ensure that a real-time application will meet its deadlines despite failures. The authors develop an analytical model to calculate the probability of successful execution of applications with task replications. They propose an efficient algorithm for the analysis of applications that are composed of subgraphs, each of which has a single source and a single sink. The results of the analysis can be used with information from allocation/scheduling to develop applications with desired timing and fault-tolerance requirements

Keywords

fault tolerant computing; graph theory; real-time systems; scheduling; software reliability; Maruti; allocation/scheduling; analytical model; arcs; computation graphs; desired timing; fault-tolerance requirements; precedence constraints; real-time application; real-time constraints; required fault tolerance; task replications; vertices; Application software; Educational institutions; Fault tolerance; Fault tolerant systems; Hardware; Real time systems; Redundancy; Resource management; Scheduling; Timing;

fLanguage

English

Publisher

ieee

Conference_Titel

Software Reliability Engineering, 1992. Proceedings., Third International Symposium on

Conference_Location

Research Triangle Park, NC

Print_ISBN

0-8186-2975-4

Type

conf

DOI

10.1109/ISSRE.1992.285867

Filename

285867