The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Cloud task scheduling based on ant colony optimization
Abstract
Cloud computing is the development of distributed computing, parallel computing and grid computing, or defined as the commercial implementation of these computer science concepts. One of the fundamental issues in this environment is related to task scheduling. Cloud task scheduling is an NP-hard optimization problem, and many meta-heuristic algorithms have been proposed to solve it. A good task scheduler should adapt its scheduling strategy to the changing environment and the types of tasks. In this paper a cloud task scheduling policy based on ant colony optimization algorithm compared with different scheduling algorithms FCFS and round-robin, has been presented. The main goal of these algorithms is minimizing the makespan of a given tasks set. Ant colony optimization is random optimization search approach that will be used for allocating the incoming jobs to the virtual machines. Algorithms have been simulated using Cloudsim toolkit package. Experimental results showed that the ant colony optimization outperformed FCFS and round-robin algorithms.
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
(2007) · Handbook of Approximation Algorithms and Metaheuristics · doi:10.1201/9781420010749-33 · Cited by 6,607
Swarm Intelligence: From Natural to Artificial Systems
Bonabeau, E., Dorigo, M., & Theraulaz, G. (1999) · Oxford University Press eBooks · doi:10.1093/oso/9780195131581.001.0001 · Cited by 6,435
Integer and Combinatorial Optimization
Williams, H. P., Nemhauser, G. L., & Wolsey, L. A. (1990) · Journal of the Operational Research Society · doi:10.2307/2583737 · Cited by 5,485
Integer and Combinatorial Optimization
Nemhauser, G., & Wolsey, L. (1988) · Wiley eBooks · doi:10.1002/9781118627372 · Cited by 3,176
Modern heuristic techniques for combinatorial problems
Reeves, C. R. (1993) · Medical Entomology and Zoology · Cited by 2,580
Ant colony optimization theory: A survey
Dorigo, M., & Blum, C. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.05.020 · Cited by 2,295
Dorigo, M., Birattari, M., & Stutzle, T. (2006) · IEEE Computational Intelligence Magazine · doi:10.1109/ci-m.2006.248054 · Cited by 1,880
Ranjith Kumar, A., & Ranjith Kumar, R. (2011) · Cited by 1,225
Buyya, R., Ranjan, R., & Calheiros, R. N. (2009) · 2009 International Conference on High Performance Computing & Simulation · doi:10.1109/hpcsim.2009.5192685 · Cited by 1,099
Weiss, A. (2007) · netWorker · doi:10.1145/1327512.1327513 · Cited by 678
A multi-objective ant colony system algorithm for virtual machine placement in cloud computing
Gao, Y., Guan, H., Qi, Z., Hou, Y., & Liu, L. (2013) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2013.02.004 · Cited by 671
A Multiple QoS Constrained Scheduling Strategy of Multiple Workflows for Cloud Computing
Xu, M., Cui, L., Wang, H., et al. (2009) · IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA) · doi:10.1109/ispa.2009.95 · Cited by 235
Hybrid Genetic Algorithm for Cloud Computing Applications
Zhu, K., Song, H., Liu, L., Gao, J., & Cheng, G. (2011) · IEEE Asia-Pacific Services Computing Conference (APSCC) · doi:10.1109/apscc.2011.66 · Cited by 110
GRAAA: Grid Resource Allocation Based on Ant Algorithm
Singh, M. (2010) · Journal of Advances in Information Technology · doi:10.4304/jait.1.3.133-135 · Cited by 12
Cited by
A review of metaheuristic scheduling techniques in cloud computing
Kalra, M., & Singh, S. (2015) · Egyptian Informatics Journal · doi:10.1016/j.eij.2015.07.001 · Cited by 409
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
Dynamic Cloud Task Scheduling Based on a Two-Stage Strategy
Zhang, P., & Zhou, M. (2018) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2017.2693688 · Cited by 290
Load Balancing Based Task Scheduling with ACO in Cloud Computing
Gupta, A., & Garg, R. (2017) · 2017 International Conference on Computer and Applications (ICCA) · doi:10.1109/comapp.2017.8079781 · Cited by 88
“[12] presents task scheduling on cloud environment using ACO algorithm.”
MethodVirtual Machine Placement Based on Ant Colony Optimization for Minimizing Resource Wastage
Tawfeek, M. A., El-Sisi, A. B., Keshk, A. E., & Torkey, F. A. (2014) · Communications in Computer and Information Science · doi:10.1007/978-3-319-13461-1_16 · Cited by 45
Self-citation
Metadata
- Authors
- Tawfeek, M. A., El-Sisi, A., Keshk, A. E., & Torkey, F. A.
- Venue
- 2013 8th International Conference on Computer Engineering & Systems (ICCES)
- Publisher
- IEEE
- Published
- 2013-11
- Pages
- 64-69
- OpenAlex
- W2063281062
- Cited by
- 303
- References
- 14
- FWCI
- 8.34
- Type
- conference paper
- 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.