[1]都志辉, 陈渝, 刘鹏. 网格计算[M].北京:清华大学出版社,2002:3-16.[2]MAHESWARAN M, ALI S, SIEGEL H J, et al. Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems [C]// HCW'99: Proceedings of the 8th Heterogeneous Computing Workshop. Washington, DC: IEEE Computer Society, 1999:30-44.[3]MAHESWARAN M, ALI S, SIEGEL H J, et al. A comparison of dynamic strategies for mapping a class of independent tasks onto heterogeneous computing systems [R]. West Lafayette, Indiana: Purdue University, School of Electrical and Computer Engineering, 1999.[4]WU M Y, SHU W, ZHANG H. Segmented Min-Min: A static mapping algorithm for meta-tasks on heterogeneous computing systems [C]// Proceedings of the 9th IEEE Heterogeneous Computing Workshop. Washington, DC: IEEE Computer Society, 2000:375-385.[5]CASANOVA H, LEGRAND A, ZAGORODNOV D, et al. Heuristics for scheduling parameter sweep applications in grid environments [C]// Proceedings of the 9th Heterogeneous Computing Workshop. Washington, DC: IEEE Computer Society, 2000:349-363.[6]王树鹏, 云晓春, 余翔湛. 基于生存性和Makespan的多目标网格任务调度算法研究[J]. 通信学报, 2006, 27(2):43-45.[7]乔付, 张国印, 刘忠艳. 基于多目标冲突度网格任务调度策略[J]. 计算机应用研究, 2009,26(4):1491-1493.[8]DEB K, PRATAP A, AGARWAL S, et al. A fast and elitist multiobjective genetic algorithm: NSGA-Ⅱ[J]. IEEE Transactions on Evolutionary Computation, 2002, 6(2): 182-197.[9]薛胜军, 杨明. 一种新的自适应邻域的多目标进化算法[J]. 计算机工程与应用, 2011,47(25):49-53.[10]MAHESWARAN M, ALI S, SIEGEL H J, et al. Dynamic mapping of a class of independent tasks onto heterogeneous computing systems [J]. Journal of Parallel and Distributed Computing, 1999, 59(2):107-131. |