Pages that link to "Item:Q1360110"
From MaRDI portal
The following pages link to Efficient algorithms for the reliabilities of replicated \(n\)-parallel-task graphs (Q1360110):
Displaying 5 items.
- Reliability analysis of a simple replicated and-fork/and-join graph (Q1342096) (← links)
- Linear-time algorithms for computing the reliability of bipartite and (\(\# \leqslant 2\)) star distributed computing systems. (Q1422361) (← links)
- Optimal replication of series-parallel graphs for computation-intensive applications (Q1898178) (← links)
- Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms (Q2434302) (← links)
- Reliability analysis of replicated and-or graphs (Q4347272) (← links)