A DAG Task Scheduling Scheme on Heterogeneous Computing Systems Using Invasive Weed Optimization Algorithm
2014 Sixth International Symposium on Parallel Architectures, Algorithms and Programming (PAAP) (2014)
July 13, 2014 to July 15, 2014
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PAAP.2014.34
Efficient task scheduling is crucial to heterogeneous cluster performance. And various scheduling methods based on random search technique have been proposed for both homogeneous and heterogeneous cluster systems. However, most of these methods have high computational overhead and poor convergence. Invasive weed optimization algorithm (IWO) is a novel bionic intelligent optimization algorithm that has fast convergence rate and easier implementation than traditional genetic algorithm (GA) based algorithm. In this paper, an IWO task scheduling (IWOTS) algorithm is proposed for heterogeneous cluster system. To the best of our knowledge, this study is the first time to apply IWO to discrete task scheduling problems. Extensive simulation experiment results show that IWOTS generally exhibits outstanding convergence performance and could produce an optimal scheduling strategy.
Scheduling, Program processors, Processor scheduling, Clustering algorithms, Algorithm design and analysis, Optimal scheduling
K. Li, S. Li, Y. Xu and Z. Xie, "A DAG Task Scheduling Scheme on Heterogeneous Computing Systems Using Invasive Weed Optimization Algorithm," 2014 Sixth International Symposium on Parallel Architectures, Algorithms and Programming (PAAP), Beijing, China, 2014, pp. 262-267.