基于最小化传输和完成时间的多DAG调度.pdf

38 23 2012 12 Vol.38 No.23 Computer Engineering December 20 12 ·· 2012 A TP393 DAG 1 1,2 1 (1. 830046 2. 100081) (DAG)(LTCT) DAG DAG DAG LTCT E-Fairness DAG Makespan DAG Multiple DAG Scheduling Based on Lowest Transportation and Completion Time 1 1,2 1 REN Feng-ling , YU Jiong , YANG Xing-yao (1. School of Information Science and Engineering, Xinjiang University, Urumqi 830046, China; 2. School of Computer, Beijing Institute of Technology, Beijing 100081, China) Abstract According to multiple DAG workflow scheduling problem in heterogeneous distributed environments, a scheduling algorithm is proposed based on minimizing the data transmission time and task completion time, which can deal with the problem that multiple DAG workflows have the same priority, and gives the multi-priority multi-DAG mixed scheduling algorithm. Compared with E-Fairness algorithm, experimental results show that on the basis of fairness to ensure multiple DAG scheduling, this algorithm can avoid additional data transfer overhead, shorten the entire workflow execution Makespan, and improve resource utilization. Key words multiple DAG scheduling; multi-priority; task weight; fairness; time span; slot DOI: 10.3969/j.issn.1000-3428.2012.23.072 1 DAG [11] DAG (Directed Acyclic Graph, DAG) DAG [1] [2-7] DAG