The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
A Genetic Algorithm (GA) based Load Balancing Strategy for Cloud Computing
Open accessAbstract
The next-generation of cloud computing will thrive on how effectively the infrastructure are instantiated and available resources utilized dynamically. Load balancing which is one of the main challenges in Cloud computing, distributes the dynamic workload across multiple nodes to ensure that no single resource is either overwhelmed or underutilized. This can be considered as an optimization problem and a good load balancer should adapt its strategy to the changing environment and the types of tasks. This paper proposes a novel load balancing strategy using Genetic Algorithm (GA). The algorithm thrives to balance the load of the cloud infrastructure while trying minimizing the make span of a given tasks set. The proposed load balancing strategy has been simulated using the CloudAnalyst simulator. Simulation results for a typical sample application shows that the proposed algorithm outperformed the existing approaches like First Come First Serve (FCFS), Round Robing (RR) and a local search algorithm Stochastic Hill Climbing (SHC).
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Calheiros, R. N., Ranjan, R., Beloglazov, A., De Rose, C. A. F., & Buyya, R. (2011) · Software: Practice and Experience · doi:10.1002/spe.995 · Cited by 4,948
Cloud Computing: Distributed Internet Computing for IT and Scientific Research
Dikaiakos, M. D., Katsaros, D., Mehra, P., Pallis, G., & Vakali, A. (2009) · IEEE Internet Computing · doi:10.1109/mic.2009.103 · Cited by 795
Cloud Computing: Principles and Paradigms
Buyya, R., Broberg, J., & Goscinski, A. M. (2013) · Cited by 709
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
Cloud Computing: Principles and Paradigms
(2011) · Wiley eBooks · doi:10.1002/9780470940105 · Cited by 453
Cloud computing — Issues, research and implementations
Vouk, M. A. (2008) · ITI 2008 - 30th International Conference on Information Technology Interfaces · doi:10.1109/iti.2008.4588381 · Cited by 297
Cited by
Task scheduling techniques in cloud computing: A literature survey
Arunarani, A., Manjula, D., & Sugumaran, V. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2018.09.014 · Cited by 483
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
Load-balancing algorithms in cloud computing: A survey
Jafarnejad Ghomi, E., Masoud Rahmani, A., & Nasih Qader, N. (2017) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2017.04.007 · Cited by 425
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
Metadata
- Authors
- Dasgupta, K., Mandal, B., Dutta, P., Mandal, J. K., & Dam, S.
- Venue
- Procedia Technology
- Publisher
- Elsevier BV
- Published
- 2013
- Volume
- 10
- Pages
- 340-347
- ISSN
- 2212-0173 (ISSN-L)
- OpenAlex
- W1984216891
- Cited by
- 385
- References
- 7
- FWCI
- 43.86
- Type
- journal article
- Language
- en
- Open access
- diamond
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.