Time Efficient Round Robin Job Scheduling (NARR) in Cloud Computing
Afsarjahan1, Ritika Mehra2, Rakesh Saini3

1Afsar Jahan, Assistant Professor*, Department of Computer Applications Doon University Dehradun (Uttarakhand) India.
2Dr. Ritika, Professor of Computer Science, Head, Department of Computer Applications, DIT University Dehradun (Uttarakhand) India.
3Dr. Rakesh Saini, Assistant professor (senior grade) Department of Computer Science and Application,  DIT University Dehradun (Uttarakhand) India.
Manuscript received on September 23, 2019. | Revised Manuscript received on October 15, 2019. | Manuscript published on October 30, 2019. | PP: 6912-6917 | Volume-9 Issue-1, October 2019 | Retrieval Number: A1235109119/2019©BEIESP | DOI: 10.35940/ijeat.A1235.109119
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: Cloud computing simply means the advancement of distributed computing which takes data processing computational aspects over networks to centralized high-power data centers. It refers to the use of a centralized pool of resources that are distributed on a pay-per-view model to a large number of customers. This requires scheduling algorithms that allow us to define which task processes, among which resources are first allocated for performance. The Round Robin (RR) scheduling algorithm is the common scheduling algorithm used in multitasking and real-time environments. Its performance is largely determined by the amount of time it takes to carry out a specific task assigned by the CPU. If the less time is chosen the context switch is high and the higher time is chosen, the first-come first-server (FCFS) is selected. System’s performance thus totally depends on the optimal quantum time to choose from. In this paper, I’m examining a different way of improving the performance of the round robin scheduling algorithm by means of a dynamic time quantum and comparison of different performance.
Keywords: Round Robin Algorithm, Cloud Computing, Dynamic Time Quantum.