Hybrid genetic algorithm for independent tasks scheduling in heterogeneous computing systems

[1] Armstrong R, Hensgen D, Kidd T. The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions . In:7th IEEE Heterogeneous Computing Workshop , 1998. 79~87 [2]Freund R, Gherrity M, Ambrosius S, et al. Scheduling resources in multi-user, heterogeneous, computing environments with SmartNet . In:7th IEEE Heterogeneous Computing Workshop , 1998. 184~199 [3]Ibarra O, Kim C. Heuristic algorithms for scheduling independent tasks on nonidentical processors[J]. Journal of the ACM, 1977, 77(2):280~289 [4]Wang L, Siegel H J, Roychowdhury V P, et al. Task matching and scheduling in heterogeneous computing environments using a genetic-algorithm-based a pproach[J]. Journal of Parallel and Distributed Computing, 1997, 47(1):1~15 [5]Braun T, Siegel H, Beck N, et al. A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems . In:8th IEEE Heterogeneous Computing Workshop , 1999. 15~29 [6]Wu Minyou, Shu Wei, Zhang Hong. Segmented Min-min:a static mapping algorithm for meta-tasks on heterogeneous computing systems . In:9th IEEE He terogeneous Computing Workshop , 2000. 375~385 [7] 李敏强, 寇纪淞, 林 丹,等. 遗传算法的基本理论与应用[M]. 北京:科学出版社, 2002 Li Minqiang, Guan Jisong, Lin Dan, et al. The basic theory and application of genetic algorithm[M]. Beijing:Science Press, 2002(in Chinese)