Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/80473

Download PDF (Published version) (Adobe Acrobat PDF, -1 bytes)

Title

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

Author(s)

Liu, Ke;  Chen, Jinjun;  Jin, Hai;  Yang, Yun

Abstract

Transaction-intensive grid workflows are attracting more and more attentions with the prosperity of e-business and e-government applications. They are workflows normally with a huge number of relatively simple concurrent instances, such as business transactions, whilst some of which may involve considerable communication overheads. However, there are almost no specific scheduling algorithms which deal with such workflows, and existing scheduling algorithms are not efficient enough for such a scenario if corresponding adjustments are not conducted. To address this problem, we propose a novel Min-Min-Average (MMA) algorithm for efficiently scheduling transaction-intensive grid workflows involving considerable communication overheads. The MMA algorithm is based on the popular Min-Min algorithm but uses a different strategy for transaction-intensive grid workflows with the capability of adapting to the change of network transmission speed automatically. The comparison based on the simulation performed on SwinDeW-G, our peer-to-peer based grid workflow environment, demonstrates that the MMA algorithm can improve the scheduling performance significantly over the original Min-Min algorithm when scheduling transaction-intensive grid workflows with considerable communication overheads involved.

Publication type

Conference paper

Research centre

Swinburne University of Technology. Faculty of Information and Communication Technologies

Source

Conferences in research and practice in information technology series: grid computing and e-research 2009: proceedings of the 7th Australasian Symposium on Grid Computing and e-Research (AusGrid 2009), Wellington, New Zealand, 21 January 2009 / Paul Roe and Wayne Kelly (eds.), Vol. 99, pp. 41-48

Publication year

2009

FOR Code(s)

080611 Information Systems Theory

Keyword(s)

Grid workflows;  Scheduling algorithms;  Transaction-intensive workflows

Publisher

Australian Computer Society

ISSN

1445-1336 (series ISSN)

ISBN

9781920682804, 1920682805

Publisher URL

http://crpit.com/abstracts/CRPITV99Liu.html

Copyright

Copyright © 2009, Australian Computer Society, Inc. This paper appeared at the 7th Australasian Symposium on Grid Computing and e-Research (AusGrid 2009), Wellington, New Zealand. Conferences in Research and Practice in Information Technology, Vol. 99, Editors Paul Roe and Wayne Kelly. Reproduction for academic, not-for profit purposes permitted provided this text is included. The published version of the paper is reproduced here in accordance with this policy.

Research Projects

Agent-based coordination and negotiation technologies for decentralised service workflow management, Australian Research Council grant number DP0663841

Full text

Peer reviewed