Fault tolerant heterogeneous scheduling for precedence constrained task graphs using simulated annealing

摘要

Scheduling is known to be an NP complete problem in most cases that has no optimal solution in polynomial time. Scheduling task graphs on heterogeneous architecture increases the difficulty of the problem. These heterogeneous architectures like any other platforms are prone to faults thus fault tolerance techniques must be used to ensure accomplishment of the job therefore task replication is used to achieve fault tolerance. However scheduling complexity is increased and the schedule length is affected dramatically due to duplication. Also task replication introduces great communication delays overhead. Here we propose the use of simulated annealing optimization method to find optimal solution according to platform reliability, where the algorithm can be used to minimize lower bound makespan on high reliability platforms and genuinely optimize upper bound makespan for platforms that are prone to failures.