Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms.
Anne BenoitLouis-Claude CanonEmmanuel JeannotYves RobertPublished in: J. Sched. (2012)
Keyphrases
- computational complexity
- worst case
- polynomial time complexity
- orders of magnitude
- graph theory
- computational cost
- connected components
- graph search
- data structure
- computationally efficient
- optimization problems
- space complexity
- learning algorithm
- steady state
- data mining
- evolutionary algorithm
- graph structure
- graph representation
- failure rate
- high computational complexity
- breadth first search
- partitioning algorithm
- graph based algorithm