点击次数：

论文类型：会议论文

发表时间：2017-04-28

收录刊物：Scopus、EI、CPCI-S

页面范围：404-409

关键字：heterogeneous computing; DAG; dynamic workflow; fairness; dynamic priority

摘要：In Heterogeneous Computing Systems, completion time and overall fairness are both crucial to multi workflow scheduling. Unfortunately, most dynamic workflow scheduling algorithms fail to take fairness into account or adapt unreasonable fairness policy, which will probably result in some DAGs' scheduling failure in certain scenarios when they can't complete all the tasks before deadline. Aiming at the need to solve the flaws mentioned above, we propose a novel dynamic workflow scheduling algorithm named FSDP (Fairness Scheduling with Dynamic Priority for Multi Workflow). The algorithm focuses on the deadline of each workflow to achieve a more reasonable fairness when allocating the processors so that those urgent workflows can acquire a higher priority. Also, a new metric, urgency, is proposed to update priority. Experimental results show that it is possible to meet different requirements of dynamic workflows.