A Survey of Backfilling Algorithms in Cloud Resource Allocation
DOI:
https://doi.org/10.26438/ijcse/v7i6.390394Keywords:
Cloud Computing, Virtualization, First Come First Serve, Backfilling, Job MigrationAbstract
Cloud computing is an information technology (IT) paradigm that enables ubiquitous access to shared pools of configurable system resources and higher-level services that has provisioned with minimal management effort over the Internet. The main enabling technology for cloud computing is Virtualization, which is essentially creating scalable system of multiple independent computing devices. With virtualization, idle computing resources have allocated to user more effectively. Allocation of idle computing resource is one of the major problem faced today in cloud computing. Adopting to right resource allocation algorithms can resolve the problem of resource allocation. Backfilling algorithms are better than the existing First Come First Serve algorithms (FCFS) used for resource allocation. In this paper, various `Backfilling` algorithms are surveyed. Further analysis on the performance of each algorithm in terms of response time, throughput, waiting time, turn-around time, job migration between queues are measured.
References
[1] D. Tsafrir, Y. Etsion, and D. G. Feitelson, “Backfilling Using Runtime Predictions Rather than User Estimates,” School of Computer Science and Engineering, Hebrew University of Jerusalem, Tech. Rep. TR 2005-5, 2003. [2] Bhupesh Kumar Dewangan, Amit Agarwal,Venkatadri M, Ashutosh Pasricha,” Resource Scheduling in Cloud: A Comparative Study”, International Journal of Computer Sciences and Engineering, Vol.-6, Issue-8, pp. 168-173,Aug 2018.
[3] Rajnish Choubey et al., “A Survey on Cloud Computing Security, Challenges and Threats”, International Journal of Computer Sciences and Engineering, Vol. 3,No. 3 ,pp.1227-1231,Mar 2011.
[4] D. G. Feitelson, L. Rudolph, and U. Schwiegelshohn, “Parallel job scheduling strategies for parallel processing”, In Proceedings of the 10th International Conference on Job Scheduling Strategies for Parallel Processing, ser. JSSPP’04. Berlin, Heidelberg: Springer-Verlag, pp. 1–16 , 2005.
[5] Dror G. Feitelson and Ahuva Mu’alem Weil., “Utilization and predictability in scheduling the IBM SP2 with backfilling”, In Proceeding of the 12th International Parallel and Distributed Processing Symposium, pp. 542–546, 1998.
[6] U. Schwiegelshohn and R. Yahyapour., “Fairness in Parallel Job Scheduling”, “Journal of Scheduling”, 3(5) pp:297-320. John Wiley, 2000.
[7] Shahabanath K K, Sreekesh Namboodiri T, “K-Tier And Selective Backfilling Approach for Parallel Workload Scheduling in Cloud”, International Journal of Advanced Research in Computer Engineering & Technology (IJARCET), Volume 3 Issue 9, September 2014.
[8] Xiaocheng Liu, Chen Wang, Bing Bing Zhou, Junliang Chen,Ting Yang, and Albert Y. Zomaya, “Priority-Based Consolidation Of Parallel Workloads In The Cloud”, IEEE Transactions On Parallel And Distributed Systems, Vol. 24, No. 9, September 2013.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
