The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Evolutionary Multi-Objective Workflow Scheduling in Cloud
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
The NIST definition of cloud computing
Mell, P. M., & Grance, T. (2011) · doi:10.6028/nist.sp.800-145 · Cited by 11,795
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Zhang, Q., & Li, H. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.892759 · Cited by 10,069
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Zitzler, E., & Thiele, L. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.797969 · Cited by 8,798
SPEA2: Improving the strength pareto evolutionary algorithm
Zitzler, E., Laumanns, M., & Thiele, L. (2001) · doi:10.3929/ethz-a-004284029 · Cited by 5,008
Performance-effective and low-complexity task scheduling for heterogeneous computing
Topcuoglu, H., Hariri, S., & Wu, M.-Y. (2002) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.993206 · Cited by 3,475
Cloud Computing and Grid Computing 360-Degree Compared
Foster, I., Zhao, Y., Raicu, I., & Lu, S. (2008) · 2008 Grid Computing Environments Workshop · doi:10.1109/gce.2008.4738445 · Cited by 2,912
Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II
Li, H., & Zhang, Q. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.925798 · Cited by 2,543
Pegasus: A Framework for Mapping Complex Scientific Workflows onto Distributed Systems
Deelman, E., Singh, G., Su, M.-H., Blythe, J., Gil, Y., Kesselman, C., Mehta, G., Vahi, K., Berriman, G. B., Good, J., et al. (2005) · Scientific Programming · doi:10.1155/2005/128026 · Cited by 1,222
The NIST Definition of Cloud Computing
(2017) · Application Performance Management (APM) in the Digital Enterprise · doi:10.1016/b978-0-12-804018-8.15003-x · Cited by 894
Characterizing and profiling scientific workflows
Juve, G., Chervenak, A., Deelman, E., Bharathi, S., Mehta, G., & Vahi, K. (2013) · Future Generation Computer Systems · doi:10.1016/j.future.2012.08.015 · Cited by 788
Shift-Based Density Estimation for Pareto-Based Algorithms in Many-Objective Optimization
Li, M., Yang, S., & Liu, X. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2262178 · Cited by 714
Self-citationCharacterization of scientific workflows
Bharathi, S., Chervenak, A., Deelman, E., Mehta, G., Su, M.-H., & Vahi, K. (2008) · 2008 Third Workshop on Workflows in Support of Large-Scale Science · doi:10.1109/works.2008.4723958 · Cited by 618
A Non-dominated Sorting Particle Swarm Optimizer for Multiobjective Optimization
Li, X. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-45105-6_4 · Cited by 532
Chen, W.-N., & Zhang, J. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2008.2001722 · Cited by 362
ASKALON: a Grid application development and computing environment
Fahringer, T., Prodan, R., Duan, R., Nerieri, F., Podlipnig, S., Qin, J., Siddiqui, M., Truong, H., Villazón, A., & Wieczorek, M. A. (2005) · IEEE/ACM International Conference on Grid Computing (GRID) · doi:10.1109/grid.2005.1542733 · Cited by 189
Multi-objective workflow scheduling in Amazon EC2
Durillo, J. J., & Prodan, R. (2014) · Cluster Computing · doi:10.1007/s10586-013-0325-0 · Cited by 173
Cost-efficient task scheduling for executing large programs in the cloud
Su, S., Li, J., Huang, Q., et al. (2013) · Parallel Computing · doi:10.1016/j.parco.2013.03.002 · Cited by 167
A Budget Constrained Scheduling Algorithm for Workflow Applications
Arabnejad, H., & Barbosa, J. G. (2014) · Journal of Grid Computing · doi:10.1007/s10723-014-9294-7 · Cited by 151
Costing of Cloud Computing Services: A Total Cost of Ownership Approach
Martens, B., Walterbusch, M., & Teuteberg, F. (2012) · Hawaii International Conference on System Sciences (HICSS) · doi:10.1109/hicss.2012.186 · Cited by 139
Ishibuchi, H., Hitotsuyanagi, Y., Tsukamoto, N., & Nojima, Y. (2010) · Springer eBooks · doi:10.1007/978-3-642-15871-1_10 · Cited by 127
Ordinal Optimized Scheduling of Scientific Workflows in Elastic Compute Clouds
Zhang, F., Cao, J., Hwang, K., et al. (2011) · IEEE International Conference on Cloud Computing Technology and Science · doi:10.1109/cloudcom.2011.12 · Cited by 49
Cited by
Song, B., Wang, Z., & Zou, L. (2021) · Applied Soft Computing · doi:10.1016/j.asoc.2020.106960 · Cited by 441
Houssein, E. H., Gad, A. G., Wazery, Y. M., & Suganthan, P. N. (2021) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2021.100841 · Cited by 355
Multiobjective Cloud Workflow Scheduling: A Multiple Populations Ant Colony System Approach
Chen, Z.-G., Zhan, Z.-H., Lin, Y., Gong, Y.-J., Gu, T.-L., Zhao, F., Yuan, H.-Q., Chen, X., Li, Q., & Zhang, J. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2832640 · Cited by 278
Minimizing cost and makespan for workflow scheduling in cloud using fuzzy dominance sort based HEFT
Zhou, X., Zhang, G., Sun, J., Zhou, J., Wei, T., & Hu, S. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2018.10.046 · Cited by 255
Self-citation
Metadata
- Authors
- Zhu, Z., Zhang, G., Li, M., & Liu, X.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2016-05-01
- Volume
- 27
- Issue
- 5
- Pages
- 1344-1357
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2327866891
- Cited by
- 401
- References
- 22
- FWCI
- 70.27
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.