The DOI matches its Crossref record; 100 of the 100 references it cites were found in a registry or an index.
A comprehensive survey for scheduling techniques in cloud computing
Abstract
Abstract Resource scheduling becomes the prominent issue in cloud computing due to rapid growth of on demand request and heterogeneous nature of cloud resources. Cloud provides dynamism, uncertainty and elasticity based services to users in pay-as-you-go fashion over the internet. In recent decade, increase in requests (diverse and complex applications) for cloud services is raising the workload in cloud environment. Inefficient scheduling techniques face the challenges of resources being over utilized and underutilized (imbalanced) which leads to either degradation in service performance (in case of over utilized) or wastage of cloud resources (in case of underutilized). The basic idea behind the scheduling is to distribute tasks (diverse and complex nature) among the cloud resources in such a manner that scheduling algorithm avoids the problem of imbalance. Scheduling algorithm should also optimize the key performance indicator parameters like response time, makespan time, reliability, availability, energy consumption, cost, resource utilization etc. To fulfill the above-mentioned objective, many state of art scheduling algorithms have been proposed based upon heuristic, meta-heuristic and hybrid, reported in the literature. This paper provides the systematic review as well as classification of proposed scheduling techniques along with their advantages and limitations. We hope that our systematic and comprehensive survey work as a stepping stone for new researchers in the field of cloud computing and will be helpful for further development of scheduling technique.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
A New Metaheuristic Bat-Inspired Algorithm
Yang, X.-S. (2010) · Studies in Computational Intelligence · doi:10.1007/978-3-642-12538-6_6 · Cited by 4,905
A discrete binary version of the particle swarm algorithm
Kennedy, J., & Eberhart, R. C. (2002) · 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation · doi:10.1109/icsmc.1997.637339 · Cited by 4,767
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
Beloglazov, A., Abawajy, J., & Buyya, R. (2012) · Future Generation Computer Systems · doi:10.1016/j.future.2011.04.017 · Cited by 2,761
Dual u-net with resnet encoder for segmentation of medical images
Syed, Q. N., & Ismail, A. R. (2022) · The International Islamic University Malaysia Repository (The International Islamic University Malaysia) · Cited by 1,142
S-shaped versus V-shaped transfer functions for binary Particle Swarm Optimization
Mirjalili, S., & Lewis, A. (2013) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2012.09.002 · Cited by 1,099
Dynamic Resource Allocation Using Virtual Machines for Cloud Computing Environment
Xiao, Z., Song, W., & Chen, Q. (2013) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2012.283 · Cited by 858
Particle Swarm Optimization in Wireless-Sensor Networks: A Brief Survey
Kulkarni, R. V., & Venayagamoorthy, G. K. (2011) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2010.2054080 · Cited by 732
Analysis of Particle Swarm Optimization Algorithm
Bai, Q. (2010) · Computer and Information Science · doi:10.5539/cis.v3n1p180 · Cited by 724
Cited by
Abualigah, L., & Diabat, A. (2021) · Cluster Computing · doi:10.1007/s10586-020-03075-5 · Cited by 355
Walia, G. K., Kumar, M., & Gill, S. S. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3338015 · Cited by 279
Self-citationSingh, H., Tyagi, S., Kumar, P., Gill, S. S., & Buyya, R. (2021) · Simulation Modelling Practice and Theory · doi:10.1016/j.simpat.2021.102353 · Cited by 104
A systematic review on effective energy utilization management strategies in cloud data centers
Panwar, S. S., Rauthan, M. M. S., & Barthwal, V. (2022) · Journal of Cloud Computing · doi:10.1186/s13677-022-00368-5 · Cited by 65
Journey from cloud of things to fog of things: survey, new trends, and research directions
Chakraborty, A., Kumar, M., Chaurasia, N., & Gill, S. S. (2023) · Software: Practice and Experience · doi:10.1002/spe.3157 · Cited by 31
Self-citation
Metadata
- Authors
- Kumar, M., Sharma, S. C., Goel, A., & Singh, S. P.
- Venue
- Journal of Network and Computer Applications
- Publisher
- Elsevier BV
- Published
- 2019-10
- Volume
- 143
- Pages
- 1-33
- ISSN
- 1084-8045 (ISSN-L)
- OpenAlex
- W2949236164
- Cited by
- 364
- References
- 100
- FWCI
- 56.23
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A comprehensive survey for scheduling techniques in cloud computing. https://app.cochat.ai/papers/10.1016/j.jnca.2019.06.006
- The paper
- Kumar, M., Sharma, S. C., Goel, A., & Singh, S. P. (2019). A comprehensive survey for scheduling techniques in cloud computing. Journal of Network and Computer Applications. https://doi.org/10.1016/j.jnca.2019.06.006
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.