Task Scheduling in Heterogeneous Computing Systems Using a MicroGA

The paper deals with the problem of scheduling precedence-constrained applications on a distributed heterogeneous computing system with the aim of minimizing the response time or total execution time. We design and investigate the effectiveness of a micro genetic algorithm based scheduling algorithm. Due to a lack of generally accepted standard benchmarks for the evaluation of scheduling algorithms in the heterogeneous computing systems we also generate a benchmark of synthetic instances. The benchmark is composed of small size synthetic deterministic non-preemptive program graphs proposed in the literature. We design a branch and bound algorithm to compute the optimal solution and the global optimal value. We compare the performance of the proposed microGA with the optimal values considering an approximation factor.