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.
KeywordsSimulated Annealing Test Bench Optimal Schedule Deterministic Algorithm Task Graph
Unable to display preview. Download preview PDF.
- Kwok, Y.-K., Ahmad, I. (1998) Benchmarking the Task Graph Scheduling Algorithms, Proceedings of the 12th International Parallel Processing Symposium, pp. 531–537Google Scholar
- Hönig, U., Schiffmann, W. (2004) A comprehensive Test Bench for the Evaluation of Scheduling Heuristics, Proceedings of the sixteenth IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2004), pp. 437–442Google Scholar
- Blum, C., Roli, A. (2003) Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison, ACM Computing Surveys, Vol. 35, No. 3Google Scholar
- Dail, H., Casanova, H., Berman, F. (2002) A Decoupled Scheduling Approach for the GrADS Program Development Environment, Proceedings of the 2002 ACM/IEEE conference on Supercomputing, pp. 1–14Google Scholar