RELIABILITY-ANALYSIS OF A SIMPLE REPLICATED AND-FORK AND-JOIN GRAPH

Authors
LIANG DR JAN RH
Citation
Dr. Liang et Rh. Jan, RELIABILITY-ANALYSIS OF A SIMPLE REPLICATED AND-FORK AND-JOIN GRAPH, Operations research letters, 16(1), 1994, pp. 51-59
Citations number
9
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science
Journal title
Operations research letters → ACNP
ISSN journal
01676377
Volume
16
Issue
1
Year of publication
1994
Pages
51 - 59
Database
ISI
SICI code
0167-6377(1994)16:1<51:ROASRA>2.0.ZU;2-X
Abstract
In this paper, we consider the problem of calculating the reliability of the replicated and-fork/and-join (RAFAJ) task graphs. An RAFAJ task graph is generated from an AFAJ task graph with vertex and arc replic ations. Due to the AFAJ constraint, the task graphs considered in our problem are more general than those considered in the network reliabil ity problem, which is an NP-complete problem for general task graphs. In this paper, we propose an algorithm with time complexity O(n . 2(2r )); where n is numbere of concurrent tasks, and r is the number of rep lications.