Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/12614
Title: | Evolutionary multi-objective workflow scheduling in Cloud |
Authors: | Zhu, Z Zhang, G Li, M Liu, X |
Keywords: | Cloud computing;Infrastructure as a Service;Evolutionary algorithm;Infrastructure as a service;Multi-objective optimization;Workflow scheduling |
Issue Date: | 2015 |
Publisher: | IEEE |
Citation: | IEEE Transactions on Parallel and Distributed Systems, 27(5): 1344 - 1357, (2015) |
Abstract: | Cloud computing provides promising platforms for executing large applications with enormous computational resources to offer on demand. In a Cloud model, users are charged based on their usage of resources and the required quality of service (QoS) specifications. Although there are many existing workflow scheduling algorithms in traditional distributed or heterogeneous computing environments, they have difficulties in being directly applied to the Cloud environments since Cloud differs from traditional heterogeneous environments by its service-based resource managing method and pay-per-use pricing strategies. In this paper, we highlight such difficulties, and model the workflow scheduling problem which optimizes both makespan and cost as a Multi-objective Optimization Problem (MOP) for the Cloud environments. We propose an evolutionary multi-objective optimization (EMO)-based algorithm to solve this workflow scheduling problem on an infrastructure as a service (IaaS) platform. Novel schemes for problem-specific encoding and population initialization, fitness evaluation and genetic operators are proposed in this algorithm. Extensive experiments on real world workflows and randomly generated workflows show that the schedules produced by our evolutionary algorithm present more stability on most of the workflows with the instance-based IaaS computing and pricing models. The results also show that our algorithm can achieve significantly better solutions than existing state-of-the-art QoS optimization scheduling algorithms in most cases. The conducted experiments are based on the on-demand instance types of Amazon EC2; however, the proposed algorithm are easy to be extended to the resources and pricing models of other IaaS services. |
URI: | http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7127017 http://bura.brunel.ac.uk/handle/2438/12614 |
DOI: | http://dx.doi.org/10.1109/TPDS.2015.2446459 |
ISSN: | 1045-9219 |
Appears in Collections: | Dept of Computer Science Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 1.44 MB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.