The modeling of complex computational applications as giant computational workflows has been a critically effective means of better understanding the intricacies of applications and of determining the best approach to their realization. It is a challenging assignment to schedule such workflows in the cloud while also considering users’ different quality of service requirements. The present paper introduces a new direction based on a divide-and-conquer approach to scheduling these workflows. The proposed Divide-and-conquer Workflow Scheduling algorithm (DQWS) is designed with the objective of minimizing the cost of workflow execution while respecting its deadline. The critical path concept is the inspiration behind the divide-and-conquer process. DQWS finds the critical path, schedules it, removes the critical path from the workflow, and effectively divides the leftover into some mini workflows. The process continues until only chain structured workflows, called linear graphs, remain. Scheduling linear graphs is performed in the final phase of the algorithm. Experiments show that DQWS outperforms its competitors, both in terms of meeting deadlines and minimizing the monetary costs of executing scheduled workflows.

将复杂的计算应用程序建模为巨大的计算工作流，已成为一种至关重要的有效手段，它可以更好地理解应用程序的复杂性并确定实现其最佳方法。在云中安排此类工作流，同时还要考虑用户的不同服务质量要求，这是一项艰巨的任务。本文介绍了一种基于分而治之的方法来调度这些工作流的新方向。拟议的分而治之工作流调度算法（DQWS）的设计目标是在遵守工作流截止期限的同时将工作流执行的成本降至最低。关键路径概念是分而治之背后的灵感。DQWS找到关键路径，对其进行调度，从工作流程中删除关键路径，然后将剩余的食物有效地分成一些小型工作流程。这个过程一直持续到只有链状结构的工作流程（称为线性图）剩余为止。调度线性图是在算法的最后阶段执行的。实验表明，DQWS在完成截止日期和最小化执行预定工作流方面的金钱成本方面都优于竞争对手。