HCOC: a cost optimization algorithm for workflow scheduling in hybrid clouds
Open Access
- 3 August 2011
- journal article
- research article
- Published by Sociedade Brasileira de Computacao - SB in Journal of Internet Services and Applications
- Vol. 2 (3), 207-227
- https://doi.org/10.1007/s13174-011-0032-0
Abstract
Workflows have been used to represent a variety of applications involving high processing and storage demands. As a solution to supply this necessity, the cloud computing paradigm has emerged as an on-demand resources provider. While public clouds charge users in a per-use basis, private clouds are owned by users and can be utilized with no charge. When a public cloud and a private cloud are merged, we have what we call a hybrid cloud. In a hybrid cloud, the user has elasticity provided by public cloud resources that can be aggregated to the private resources pool as necessary. One question faced by the users in such systems is: Which are the best resources to request from a public cloud based on the current demand and on resources costs? In this paper we deal with this problem, presenting HCOC: The Hybrid Cloud Optimized Cost scheduling algorithm. HCOC decides which resources should be leased from the public cloud and aggregated to the private cloud to provide sufficient processing power to execute a workflow within a given execution time. We present extensive experimental and simulation results which show that HCOC can reduce costs while achieving the established desired execution time.Keywords
This publication has 22 references indexed in Scilit:
- A performance‐oriented adaptive scheduler for dependent tasks on gridsConcurrency and Computation: Practice and Experience, 2007
- A notation and system for expressing and executing cleanly typed workflows on messy scientific dataACM SIGMOD Record, 2005
- Biobjective Scheduling Algorithms for Execution Time-Reliability Trade-off in Heterogeneous Computing SystemsThe Computer Journal, 2005
- Performance-effective and low-complexity task scheduling for heterogeneous computingIEEE Transactions on Parallel and Distributed Systems, 2002
- An opportunity cost approach for job assignment in a scalable computing clusterIEEE Transactions on Parallel and Distributed Systems, 2000
- Static scheduling algorithms for allocating directed task graphs to multiprocessorsACM Computing Surveys, 1999
- Task Scheduling in NetworksSIAM Journal on Discrete Mathematics, 1997
- Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessorsIEEE Transactions on Parallel and Distributed Systems, 1996
- A genetic algorithm for multiprocessor schedulingIEEE Transactions on Parallel and Distributed Systems, 1994
- DSC: scheduling parallel tasks on an unbounded number of processorsIEEE Transactions on Parallel and Distributed Systems, 1994