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

Authors:
Ke Liu;Jinjun Chen;Yun Yang;Hai Jin
Affiliations:
Centre for Info. Technol. Res., Fac. of Info. and Comm. Technol., Swinburne Univ. of Technol., P.O. Box 218, Hawthorn, Melbourne, Vic. 3122, Australia and Sch. of Comp. Sci. and Technol., Huazhong ...;Centre for Information Technology Research, Faculty of Information and Communication Technologies, Swinburne University of Technology, P.O. Box 218, Hawthorn, Melbourne, Vic. 3122, Australia;Centre for Information Technology Research, Faculty of Information and Communication Technologies, Swinburne University of Technology, P.O. Box 218, Hawthorn, Melbourne, Vic. 3122, Australia;School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China
Venue:
Concurrency and Computation: Practice & Experience - 2nd International Workshop on Workflow Management and Applications in Grid Environments (WaGe2007)
Year:
2008

Citing 0
Cited 5

A Min-Min average algorithm for scheduling transaction-intensive grid workflows

AusGrid '09 Proceedings of the Seventh Australasian Symposium on Grid Computing and e-Research - Volume 99
A Compromised-Time-Cost Scheduling Algorithm in SwinDeW-C for Instance-Intensive Cost-Constrained Workflows on a Cloud Computing Platform

International Journal of High Performance Computing Applications
A novel statistical time-series pattern based interval forecasting strategy for activity durations in workflow systems

Journal of Systems and Software
A Scheduling Algorithm for the Distributed Student Registration System in Transaction-Intensive Environment

International Journal of Distance Education Technologies
Managing large numbers of business processes with cloud workflow systems

AusPDC '12 Proceedings of the Tenth Australasian Symposium on Parallel and Distributed Computing - Volume 127

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the rapid development of e-business, workflow systems now 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. Copyright © 2008 John Wiley & Sons, Ltd.