Computing the Expected Makespan of Task Graphs in the Presence of Silent Errors.

Henri Casanova Julien Herrmann Yves Robert

Published in: ICPP Workshops (2016)

Keyphrases

scheduling problem
graph matching
graph theory
graph structure
weighted graph
scheduling jobs
labeled graphs
batch processing
error detection
graph clustering
undirected graph
graph model
processing times
bayesian networks
flowshop
np hard
lower bound
pattern recognition