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.
|Number of pages||10|
|Journal||Proceedings - International Symposium on Software Reliability Engineering, ISSRE|
|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