Hybrid task scheduling strategy for cloud computing by modified particle swarm optimization and fuzzy theory
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
As the world is progressing towards more efficient computing and faster approaches, cloud computing is a popular computing model to such increasing requirements. In order to provide cost-effective executions in cloud environment, appropriate task scheduling strategy is necessary. This paper proposes a hybrid task scheduling algorithm named FMPSO that is based on Fuzzy system and Modified Particle Swarm Optimization technique to enhance load balancing and cloud throughput. FMPSO strategy at first considers four modified velocity updating methods and roulette wheel selection technique to enhance the global search capability. Then, it uses crossover and mutation operators to overcome some drawbacks of PSO such as local optima. Finally, this schema applies fuzzy inference system for fitness calculations. The input parameters for the proposed fuzzy system are length of tasks, speed of CPU, size of RAM, and total execution time. By adding these fuzzy systems, FMPSO strategy achieves the goal of minimizing the execution time and resource usage. We evaluate FMPSO algorithm using the CloudSim toolkit and simulation results demonstrate that the proposed strategy has a better performance in terms of makespan, improvement ratio, imbalance degree, efficiency, and total execution time comparing to other approaches.
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
Hameed, I. A. (2011) · Expert Systems with Applications · doi:10.1016/j.eswa.2010.12.048 · Cited by 111
Cited by
Particle Swarm Optimization Algorithm and Its Applications: A Systematic Review
Gad, A. G. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-021-09694-4 · Cited by 1,869
A mayfly optimization algorithm
Zervoudakis, K., & Tsafarakis, S. (2020) · Computers & Industrial Engineering · doi:10.1016/j.cie.2020.106559 · Cited by 692
Major Advances in Particle Swarm Optimization: Theory, Analysis, and Application
Houssein, E. H., Gad, A. G., Hussain, K., & Suganthan, P. N. (2021) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2021.100868 · Cited by 466
RetractedHoussein, 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
Metadata
- Authors
- Mansouri, N., Mohammad Hasani Zade, B., & Javidi, M. M.
- Venue
- Computers & Industrial Engineering
- Publisher
- Elsevier BV
- Published
- 2019-04
- Volume
- 130
- Pages
- 597-633
- ISSN
- 0360-8352 (ISSN-L)
- OpenAlex
- W2920995258
- Cited by
- 193
- References
- 2
- FWCI
- 32.49
- Type
- journal article
- Language
- en
- Open access
- closed
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.