Multiple DAGs Scheduling Based on Lowest Transportation and Completion Time Algorithm on the Cloud
Feng Ling Ren, Jiong Yu · 2012
According to multiple DAG work Flow scheduling problem in heterogeneous distributed environments, in this paper, proposed a scheduling algorithm based on minimize the data transmission time and task completion time, which can deal with the problem that multiple DAGs workflow have the same priority, and gives the multi-priority multi-DAG mixed scheduling algorithm. Compared with E-Fairness algorithm, the experiments show that on the basis of fairness to ensure multiple DAGs scheduling, this algorithm can avoid additional data transfer overhead, shorten the entire workflow execution Make span, and improve resource utilization.