The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Cloud Task Scheduling Based on Load Balancing Ant Colony Optimization
Abstract
The 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. This paper proposes a cloud task scheduling policy based on Load Balancing Ant Colony Optimization (LBACO) algorithm. The main contribution of our work is to balance the entire system load while trying to minimizing the make span of a given tasks set. The new scheduling strategy was simulated using the CloudSim toolkit package. Experiments results showed the proposed LBACO algorithm outperformed FCFS (First Come First Serve) and the basic ACO (Ant Colony Optimization).
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
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
(2007) · Handbook of Approximation Algorithms and Metaheuristics · doi:10.1201/9781420010749-33 · Cited by 6,607
Xen and the art of virtualization
Barham, P., Dragovic, B., Fraser, K., Hand, S., Harris, T., Ho, A., Neugebauer, R., Pratt, I., & Warfield, A. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945462 · Cited by 5,915
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
Xen and the art of virtualization
Barham, P., Dragovic, B., Fraser, K., Hand, S., Harris, T., Ho, A., & Neugebauer, R. (2003) · Proceedings of the nineteenth ACM symposium on Operating systems principles - SOSP '03 · doi:10.1145/945461.945462 · Cited by 1,552
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
Wickremasinghe, B., Calheiros, R. N., & Buyya, R. (2010) · International Conference on Advanced Information Networking and Applications (AINA) · doi:10.1109/aina.2010.32 · Cited by 621
Calheiros, R. N., Ranjan, R. K., Rose, C. A. F. D., & Buyya, R. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0903.2525 · Cited by 489
Ant Algorithm for Grid Scheduling Problem
Fidanova, S. S., & Durchova, M. K. (2006) · Lecture notes in computer science · doi:10.1007/11666806_46 · Cited by 80
Chemical Reaction Optimization for the Grid Scheduling Problem
Xu, J., Lam, A. Y. S., & Li, V. O. K. (2010) · International Conference on Communications · doi:10.1109/icc.2010.5502406 · Cited by 67
An ACO Algorithm for Graph Coloring Problem
Salari, E., & Eshghi, K. (2006) · ICSC Congress on Computational Intelligence Methods and Applications (CIMA) · doi:10.1109/cima.2005.1662331 · Cited by 50
Task scheduling with load balancing using multiple ant colonies optimization in grid computing
Bai, L., Hu, Y., Lao, S., & Zhang, W. (2010) · International Conference on Natural Computation (ICNC) · doi:10.1109/icnc.2010.5582599 · Cited by 36
An ACO Approach to Job Scheduling in Grid Environment
Kant, A., Sharma, A., Agarwal, S., & Chandra, S. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17563-3_35 · Cited by 17
Zhang, X., & Tang, L. (2005) · ICSC Congress on Computational Intelligence Methods and Applications (CIMA) · doi:10.1109/cima.2005.1662313 · Cited by 15
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
Grid jobs scheduling: The Alienated Ant Algorithm solution
Bandieramonte, M., Stefano, A. D., & Morana, G. (2010) · Multiagent and Grid Systems · doi:10.3233/mgs-2010-0149 · Cited by 11
Cited by
Honey bee behavior inspired load balancing of tasks in cloud computing environments
L.D., D. B., & Venkata Krishna, P. (2013) · Applied Soft Computing · doi:10.1016/j.asoc.2013.01.025 · Cited by 660
Cloud Computing Resource Scheduling and a Survey of Its Evolutionary Approaches
Zhan, Z.-H., Liu, X.-F., Gong, Y.-J., Zhang, J., Chung, H. S.-H., & Li, Y. (2015) · ACM Computing Surveys · doi:10.1145/2788397 · Cited by 482
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
Load balancing in cloud computing: A big picture
Mishra, S. K., Sahoo, B., & Parida, P. P. (2020) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2018.01.003 · Cited by 384
A WOA-Based Optimization Approach for Task Scheduling in Cloud Computing Systems
Chen, X., Cheng, L., Liu, C., Liu, Q., Liu, J., Mao, Y., & Murphy, J. (2020) · IEEE Systems Journal · doi:10.1109/jsyst.2019.2960088 · Cited by 317
Metadata
- Authors
- Li, K., Xu, G., Zhao, G., Dong, Y., & Wang, D.
- Venue
- 2011 Sixth Annual Chinagrid Conference
- Publisher
- IEEE
- Published
- 2011-08
- Pages
- 3-9
- OpenAlex
- W2101651025
- Cited by
- 408
- References
- 19
- FWCI
- 10.82
- 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.