Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms (Q2434302)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6255157
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms |
scientific article; zbMATH DE number 6255157 |
Statements
Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms (English)
0 references
5 February 2014
0 references
complexity results
0 references
algorithms
0 references
task graph schedules
0 references
reliability
0 references
fail-stop and transient failures
0 references
0 references
0 references
0.7709931135177612
0 references
0.765984058380127
0 references
0.765984058380127
0 references
0.7657405734062195
0 references
