Reliable matching and scheduling of precedence-constrained tasks in heterogeneous distributed computing

In this paper; two cost functions that can be incorporated into a matching a,ld scheduling algorithm for tasks with precedence constraints are introduced to enable the algorithm to consider the reliability of different resources in the system while making decisions. The cost functions introduced are unique in the sense that they are not restricted to tree-based networks and a specific matching and scheduling algorithm. As an example, cost functions are applied to a compile time, static list scheduling heuristic. The simulation results confirm that the proposed cost functions can be exploited to produce task assignments where the effect of failures Of machines and network resources on the execution of the application is reduced.