Compute-intensive workflow scheduling in multi-cloud environment
Authors:
- 3 November 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 315-321
Abstract
Workflow scheduling is recognized as well-known NP-complete problem in the perspective of cloud computing environment. Workflow applications always need high compute-intensive operations because of the presence of precedence-constrains. The scheduling objective is to map the workflow application to the VMs pool at available cloud datacenters such that the overall processing time (makespan) is to be minimized and average cloud utilization is maximized. In this paper, we propose a two phase workflow scheduling algorithm with a new priority scheme. It considers the ratio of average communication cost to the average computation cost of the task node as a part of prioritization process in the first phase. Prioritized tasks are mapped to suitable virtual machines in the second phase. Proposed algorithm is capable of scheduling large size workflows in heterogeneous multi-cloud environment. The proposed algorithm is simulated rigorously on standard scientific workflows and simulated results are compared with the existing dependent task scheduling algorithms as per the assumed cloud model. The results remarkably show that the proposed algorithm supercedes the existing algorithms in terms of makespan, speed-up, schedule length ratio and average cloud utilization.Keywords
This publication has 14 references indexed in Scilit:
- Characterizing and profiling scientific workflowsFuture Generation Computer Systems, 2013
- Online optimization for scheduling preemptable tasks on IaaS cloud systemsJournal of Parallel and Distributed Computing, 2012
- List scheduling with duplication for heterogeneous computing systemsJournal of Parallel and Distributed Computing, 2010
- Cloud computing and emerging IT platforms: Vision, hype, and reality for delivering computing as the 5th utilityFuture Generation Computer Systems, 2009
- A high performance algorithm for static task scheduling in heterogeneous distributed computing systemsJournal of Parallel and Distributed Computing, 2008
- Low Complexity Performance Effective Task Scheduling Algorithm for Heterogeneous Computing EnvironmentsJournal of Computer Science, 2007
- Scheduling of scientific workflows in the ASKALON grid environmentACM SIGMOD Record, 2005
- Performance-effective and low-complexity task scheduling for heterogeneous computingIEEE Transactions on Parallel and Distributed Systems, 2002
- Static scheduling algorithms for allocating directed task graphs to multiprocessorsACM Computing Surveys, 1999
- DSC: scheduling parallel tasks on an unbounded number of processorsIEEE Transactions on Parallel and Distributed Systems, 1994