论文信息 - Comparison of nature inspired and deterministic scheduling heuristics considering optimal schedules

Comparison of nature inspired and deterministic scheduling heuristics considering optimal schedules

We report about a performance evaluation of nature inspired stochastic vs. conventional deterministic scheduling algorithms. By means of a comprehensive test bench, that comprises task graphs with diverse properties, we determined the absolute performance of those algorithms with respect to the optimal solutions. Surprisingly, the nature inspired stochastic algorithms outperformed all the investigated deterministic algorithms.

Wolfram Schiffmann | Udo Hönig | W. Schiffmann | U. Hönig

[1] Francine Berman,et al. A Decoupled Scheduling Approach for the GrADS Program Development Environment , 2002, ACM/IEEE SC 2002 Conference (SC'02).

[2] Christian Blum,et al. Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[3] Ishfaq Ahmad,et al. Benchmarking the task graph scheduling algorithms , 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.

[4] W. Schiffmann,et al. A COMPREHENSIVE TEST BENCH FOR THE EVALUATION OF SCHEDULING HEURISTICS , 2004 .

[5] Y.-K. Kwok,et al. Static scheduling algorithms for allocating directed task graphs to multiprocessors , 1999, CSUR.

[6] Michel Gendreau,et al. Metaheuristics in Combinatorial Optimization , 2022 .