Heuristics for Provisioning Services to Workflows in XaaS Clouds
- 3 October 2014
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 9 (2) , 250-263
Abstract
In XaaS clouds, resources as services (e.g., infrastructure, platform and software as a service) are sold to applications such as scientific and big data analysis workflows. Candidate services with various configurations (CPU type, memory size, number of machines and so on) for the same task may have different execution time and cost. Further, some services are priced rented by intervals that be shared among tasks of the same workflow to save service rental cost. Establishing a task-mode (service) mapping (to get a balance between time and cost) and tabling tasks on rented service instances are crucial for minimizing the client-oriented cost to rent services for the whole workflow. In this paper, a multiple complete critical-path based heuristic (CPIS) is developed for the task-mode mapping problem. A list based heuristic (LHCM) concerning the task processing cost and task-slot matching is developed for tabling tasks on service instances based on the result of task-mode mapping. Then, the effectiveness of the proposed CPIS is compared with that of the previously proposed CPIL, the existing state-of-the-art heuristics including PCP, SC-PCP ( an extension to PCP), DET, and CPLEX. The effectiveness of the proposed LHCM is evaluated with its use with different task-mode mapping algorithms. Experimental results show that the proposed heuristics can reduce 24 percent of the service renting cost than the compared algorithms on the test benchmarks at most for non-shareable services. In addition, half of the service renting cost could be saved when LHCM is applied to consolidate tasks on rented service instances.Keywords
Funding Information
- National Natural Science Foundation of China (61272377)
- Doctoral Program of Higher Education (20120092110027)
- Scientific Research Foundation
This publication has 25 references indexed in Scilit:
- Self-Adaptive Learning PSO-Based Deadline Constrained Task Scheduling for Hybrid IaaS CloudIEEE Transactions on Automation Science and Engineering, 2013
- Critical Path-Based Iterative Heuristic for Workflow Scheduling in Utility and Cloud ComputingLecture Notes in Computer Science, 2013
- Discrete time/cost trade-off problem: A decomposition-based solution algorithm for the budget versionComputers & Operations Research, 2010
- A new path-based cutting plane approach for the discrete time-cost tradeoff problemComputational Management Science, 2009
- Deadline division-based heuristic for cost optimization in workflow schedulingInformation Sciences, 2009
- An Ant Colony Optimization Approach to a Grid Workflow Scheduling Problem With Various QoS RequirementsIEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 2008
- Scheduling Scientific Workflow Applications with Deadline and Budget Constraints Using Genetic AlgorithmsScientific Programming, 2006
- Improving scheduling of tasks in a heterogeneous environmentIEEE Transactions on Parallel and Distributed Systems, 2004
- Complexity of the Discrete Time-Cost Tradeoff Problem for Project NetworksOperations Research, 1997
- Optimal procedures for the discrete time/cost trade-off problem in project networksEuropean Journal of Operational Research, 1996