Open Access Open Access  Restricted Access Subscription or Fee Access

Low-Low Average Algorithm for Scheduling Request-Demanding Cloud Workflows with Overhead

V. Anbalagan

Abstract


This paper addresses the scheduling algorithms for request-demand cloud workflows. Request-demand cloud workflows are workflows with a huge number of workflow requests (hence request demand) enabled on a cloud computing environment (hence cloud workflows). Unlike complex scientific workflows on which most existing workflow scheduling algorithms focus, the main characteristic of request-demand workflows is a huge number of potentially relatively simple concurrent requests. Atypical example of these workflows is the bank cheque processing scenario, in which there are millions of concurrent cheque-processing transactions per day, while each of them is a rather simple workflow with only a few steps. This distinguishing characteristic of request-demand workflows makes most existing workflow scheduling algorithms unsuitable for scheduling request-demand workflows. Moreover, if the cost needs to be considered, how to compromise the cost with execution time (make span) also becomes an important issue. As a result, this paper proposes different scheduling algorithms for request-demand workflows in different circumstances.

Keywords


Scheduling Algorithm, Demand, Request, Cloud Workflow & Overhead

Full Text:

PDF

References


I. Altintas, C. Berkley, E. Jaeger, M. Jones, B. Ludäscher and S.Mock, Kepler: An Extensible System for Design and Execution of Scientific Workflows, Proc. of 16th International Conference on Scientific and Statistical Database Management (SSDBM 2004), 423-424, Santorini Island, Greece, June 2004.

A. Avanes and J. Freytag, Adaptive Workflow Scheduling underResource Allocation Constraints and Network Dynamics.Proc.VLDB Endow, 1(2), 1631-1637, August 2008.

M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. Katz, A.Konwinski, G. Lee, D. Patterson, A. Rabkin and Ion Stoi, Above the Clouds: A Berkeley View of Cloud Computing, TechnicalReport, UCB/EECS-2009-28, UC Berkeley Reliable AdaptiveDistributed Systems Laboratory, EECS Department, University of California, Berkeley, February, 2009.

R. Allen, Workflow: an Introduction, Workflow Handbook, 2001,Workflow Management Coalition.

G. Alonso, C. Mohan, R. Guenthoer, D. Agrawal, A. El Abbadi and M. Kamath, Exotica/FMQM: A Persistent Message-Based Architecture for Distributed Workflow Management, , 1-18, Trondheim, Norway, August 1995.

R. Buyya, C. S. Yeo, and S. Venugopal, Market-Oriented Cloud and Atmospheric Computing: Hype, Reality, and Vision, Proc. Of 10th IEEE International Conference on High Performance Computing and Communications (HPCC-08), 5-13, Dalian, China, September, 2008.

W. Chen, J. Zhang, An Ant Colony Optimization Approach to a Grid Workflow Scheduling Problem With Various QoS Requirements, IEEE Transactions on Systems, Man, and Cybernetics - Part C: Applications and Reviews, Vol. 39, No. 1, January 2009.

E. Deelman, G. Singh, M. Su, J. Blythe, Y. Gil, C. Kesselman,: A Framework for Mapping Complex Scientific Workflows onto Distributed Systems. Scientific Programming, 13(3), 219-237, July 2005.

G. Gruman and E. Knorr. What Cloud Computing Really Means,InfoWorld, April 2008, Electronic Magazine, available at http://www.infoworld.com/article/08/04/07/15FE-cloudcomputing- reality_1.html, accessed on May. 19, 2009.

G. Mehta, T. Freeman. Good, On the Use of Cloud Computing for Scientific Workflows, Proc. of Fourth IEEE International Conference on e-Science,.640-645, Indianapolis, Indiana, USA, December 2008.


Refbacks

  • There are currently no refbacks.