scholarly journals Calculating Dynamic Time Quantum for Round Robin Process Scheduling Algorithm

2014 ◽  
Vol 98 (21) ◽  
pp. 20-27
Author(s):  
Aashna Bisht ◽  
Mohd Abdul Ahad ◽  
Sielvie Sharma
Keyword(s):  
Scheduling Algorithm ◽  
Round Robin ◽  
Process Scheduling ◽  
Time Quantum ◽  
Dynamic Time

scholarly journals Dynamic Time Slice Calculation for Round Robin Process Scheduling Using NOC

2015 ◽  
Vol 5 (6) ◽  
pp. 1480
Author(s):  
G Siva Nageswara Rao ◽  
N. Srinivasu ◽  
S.V.N. Srinivasu ◽  
G. Rama Koteswara Rao
Keyword(s):  
Scheduling Algorithm ◽  
Turnaround Time ◽  
Round Robin ◽  
Fine Tuning ◽  
New Method ◽  
Time Slice ◽  
Process Scheduling ◽  
Time Duration ◽  
Dynamic Time ◽  
Ready Queue

<p>Process scheduling means allocating a certain amount of CPU time to each of the user processes.  One of the popular scheduling algorithms is the “Round Robin” algorithm, which allows each and every process to utilize the CPU for short time duration.  Processes which finish executing during the time slice are removed from the ready queue.  Processes which do not complete execution during the specified time slice are removed from the front of the queue, and placed at the rear end of the queue. This paper presents an improvisation to the traditional round robin scheduling algorithm, by proposing a new method. The new method represents the time slice as a function of the burst time of the waiting process in the ready queue. Fixing the time slice for a process is a crucial factor, because it subsequently influences many performance parameters like turnaround time, waiting time, response time and the frequency of context switches.  Though the time slot is fixed for each process, this paper explores the fine-tuning of the time slice for processes which do not complete in the stipulated time allotted to them.</p>

scholarly journals Dynamic Time Quantum based Round Robin CPU Scheduling Algorithm

2017 ◽  
Vol 167 (13) ◽  
pp. 48-55 ◽  
Author(s):  
Yosef Berhanu ◽  
Abebe Alemu ◽  
Manish Kumar
Keyword(s):  
Scheduling Algorithm ◽  
Round Robin ◽  
Cpu Scheduling ◽  
Time Quantum ◽  
Dynamic Time

scholarly journals An Improved Round Robin CPU Scheduling Algorithm based on Priority of Process

2018 ◽  
Vol 7 (4.5) ◽  
pp. 238 ◽  
Author(s):  
Govind Prasad Arya ◽  
Kumar Nilay ◽  
Devendra Prasad
Keyword(s):  
Operating System ◽  
Waiting Time ◽  
Scheduling Algorithm ◽  
Round Robin ◽  
Process Scheduling ◽  
Cpu Scheduling ◽  
Average Waiting Time ◽  
Time Quantum ◽  
First Come First Serve ◽  
Time Changes

The most important and integral part of a computer system is its operating system. Scheduling various resources is one of the most critical tasks an operating system needs to perform. Process scheduling being one of those tasks, involves various techniques that define how more than one processes can be executed simultaneously. The primary aim here is to the system more efficient and faster. The fundamental scheduling algorithms are: First Come First Serve (FCFS), Round Robin, Priority Based Scheduling, and Shortest Job First (SJF). This paper focuses on Round Robin Scheduling algorithm and various issues related to it. One major issue in RR scheduling is determining the length of Time Quantum. If the Time Quantum is too large RR scheduling behaves as FCFS. On the other hand, if it is too small it forces considerable increase in the number of context switches. Our main objective is to overcome this limitation of traditional RR scheduling algorithm and maximize CPU utilization, further, leading to more efficient and faster system. Here we propose an algorithm that categorizes available processes into High Priority processes and Low Priority process. The proposed algorithm reduces the average waiting time of High Priority processes in all cases and of Low Priority processes in not all but some cases. The overall waiting time changes on the basis of set of processes considered. The simulation results justify that the proposed schemes reduces the overall average waiting time when compared to the existing schemes. 

scholarly journals Time Efficient Round Robin Job Scheduling (NARR) in Cloud Computing

2019 ◽  
Vol 9 (1) ◽  
pp. 6912-6917
Keyword(s):  
Cloud Computing ◽  
Job Scheduling ◽  
Scheduling Algorithm ◽  
Round Robin ◽  
Quantum Time ◽  
Time Quantum ◽  
Computational Aspects ◽  
The Common ◽  
Dynamic Time ◽  
Number Of Customers

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.

Sign in / Sign up

Export Citation Format

Share Document