A throughput maximization strategy for scheduling transaction-intensive workflows on SwinDeW-G

作者：Liu Ke^*; Chen Jinjun; Yang Yun; Jin Hai

来源：Concurrency and Computation-Practice & Experience, 2008, 20(15): 1807-1820.

DOI：10.1002/cpe.1316

• scheduling algorithms
• transaction-intensive workflows
• p2p-based grid workflow systems

With the rapid development of e-business, workflow systems no,,v have to deal with transaction-intensive workflows whose main characteristic is the huge number of concurrent workflow instances. For such workflows, it is important to maximize the overall throughput to provide good quality of service. However. most of the existing scheduling algorithms are designed for scheduling of a single complex scientific workflow, instance and are not efficient enough for scheduling transaction-intensive workflows. To address this problem. we propose a throughput maximization strategy (TMS), which contains two specific algorithms for scheduling transaction-intensive workflows at the instance and task levels. respectively. The first algorithm called Opposite Average Load tries to maximize the overall throughput by pursuing the overall load balance at the instance level, whereas the second algorithm called Extended Min-Min tries to further maximize the overall throughput at the task level by increasing the utilization rate of resources within each local autonomous group. The comparison and simulation performed on Swinburne Decentralized Workflow for Grid (SwinDeW-G), a peer-to-peer-based grid workflow environment, demonstrate that our strategy can improve the overall throughput significantly over existing scheduling algorithms when scheduling transaction-intensive workflows.

• 出版日期2008-10
• 单位华中科技大学