This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
|
||||||||
|
Paper Details
Paper Title
Improved Resource Allocation using k-Backfill Algorithm based on priority of job scheduling in Cloud Computing
Authors
Amit Vyas
Abstract
The Cloud computing is large group of remote servers and networks which allows centralized data storage and online access of computer services. Cloud is scalable, flexible, and supports multi-media applications. Job scheduling is big issue in cloud computing. Scheduling is more than one process to be loaded into CPU and CPU provides to share memory allocation in each process. The different types of scheduling algorithms are First Come First Serve (FCFS), Shortest Job First (SJF), Round-Robin (RR), Improve Backfill Algorithm (IBA), Backfill and P-Backfill algorithm. We have proposed modify step in Backfill and P- Backfill algorithm for job scheduling. The modify k-Backfill algorithm is schedule a job in CPU base on priority sequence and it is overcome starvation problem in P-Backfill algorithm.
Keywords- cloud, scheduling, algorithm, starvation, memory.
Publication Details
Unique Identification Number - IJEDR2002020Page Number(s) - 106-113Pubished in - Volume 8 | Issue 2 | June 2020DOI (Digital Object Identifier) - Publisher - IJEDR (ISSN - 2321-9939)
Cite this Article
Amit Vyas, "Improved Resource Allocation using k-Backfill Algorithm based on priority of job scheduling in Cloud Computing", International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, Volume.8, Issue 2, pp.106-113, June 2020, Available at :http://www.ijedr.org/papers/IJEDR2002020.pdf
Article Preview
|
|
||||||
|
|
||||||||
