Designing fault tolerant applications in Maruti

Deron Liang; Ashok Agrawala; Danniel Mosse; Yiheng Shi

doi:10.1109/ISSRE.1992.285867

Designing fault tolerant applications in Maruti

Deron Liang, Ashok Agrawala, Danniel Mosse, Yiheng Shi

Department of Computer Science and Information Engineering

Research output: Contribution to journal › Conference article › peer-review

2 Scopus citations

Abstract

In this paper, we introduce a model for developing applications 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. We develop an analytical model to calculate the probability of successful execution of applications with task replications. We 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.

Original language	English
Article number	285867
Pages (from-to)	264-273
Number of pages	10
Journal	Proceedings - International Symposium on Software Reliability Engineering, ISSRE
DOIs	https://doi.org/10.1109/ISSRE.1992.285867
State	Published - 1992
Event	3rd International Symposium on Software Reliability Engineering, ISSRE 1992 - Research Triangle Park, United States Duration: 7 Oct 1992 → 10 Oct 1992

Access to Document

10.1109/ISSRE.1992.285867

Cite this

@article{ce0979b4d8b840ee92fcf5d3047ac65e,

title = "Designing fault tolerant applications in Maruti",

abstract = "In this paper, we introduce a model for developing applications 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. We develop an analytical model to calculate the probability of successful execution of applications with task replications. We 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.",

author = "Deron Liang and Ashok Agrawala and Danniel Mosse and Yiheng Shi",

note = "Publisher Copyright: {\textcopyright} 1992 IEEE.; 3rd International Symposium on Software Reliability Engineering, ISSRE 1992 ; Conference date: 07-10-1992 Through 10-10-1992",

year = "1992",

doi = "10.1109/ISSRE.1992.285867",

language = "???core.languages.en_GB???",

pages = "264--273",

journal = "Proceedings - International Symposium on Software Reliability Engineering, ISSRE",

issn = "1071-9458",

}

TY - JOUR

T1 - Designing fault tolerant applications in Maruti

AU - Liang, Deron

AU - Agrawala, Ashok

AU - Mosse, Danniel

AU - Shi, Yiheng

PY - 1992

Y1 - 1992

N2 - In this paper, we introduce a model for developing applications 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. We develop an analytical model to calculate the probability of successful execution of applications with task replications. We 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.

AB - In this paper, we introduce a model for developing applications 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. We develop an analytical model to calculate the probability of successful execution of applications with task replications. We 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.

UR - http://www.scopus.com/inward/record.url?scp=84983669233&partnerID=8YFLogxK

U2 - 10.1109/ISSRE.1992.285867

DO - 10.1109/ISSRE.1992.285867

M3 - 會議論文

AN - SCOPUS:84983669233

SN - 1071-9458

SP - 264

EP - 273

JO - Proceedings - International Symposium on Software Reliability Engineering, ISSRE

JF - Proceedings - International Symposium on Software Reliability Engineering, ISSRE

M1 - 285867

T2 - 3rd International Symposium on Software Reliability Engineering, ISSRE 1992

Y2 - 7 October 1992 through 10 October 1992

ER -

Designing fault tolerant applications in Maruti

Abstract

Access to Document

Fingerprint

Cite this