Efficient algorithms for the reliabilities of replicated \(n\)-parallel-task graphs (Q1360110)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient algorithms for the reliabilities of replicated n-parallel-task graphs |
scientific article; zbMATH DE number 1034128
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for the reliabilities of replicated \(n\)-parallel-task graphs |
scientific article; zbMATH DE number 1034128 |
Statements
Efficient algorithms for the reliabilities of replicated \(n\)-parallel-task graphs (English)
0 references
15 July 1997
0 references
replicated task systems
0 references
fork-join networks
0 references
fault-tolerance
0 references
\(n\)-parallel-task graph
0 references
0.8565701842308044
0 references
