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 replications. Due to the AFAJ constraint, the task graphs considered in our problem are more general than those considered in the network reliability problem, which is an NP-complete problem for general task graphs. In this paper, we propose an algorithm with time complexity O(n · 22r); where n is number of concurrent tasks, and r is the number of replications.
|頁（從 - 到）||51-59|
|期刊||Operations Research Letters|
|出版狀態||已出版 - 8月 1994|