scholarly journals An Improved Round Robin Approach using Dynamic Time Quantum for Improving Average Waiting Time

2013 ◽  
Vol 69 (14) ◽  
pp. 12-16 ◽  
Author(s):  
Sandeep Negi
Keyword(s):  
Waiting Time ◽  
Round Robin ◽  
Average Waiting Time ◽  
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 Round Robin Scheduling Algorithm based on Dynamic time quantum

2019 ◽  
Vol 8 (6) ◽  
pp. 593-595
Keyword(s):  
Operating System ◽  
Waiting Time ◽  
Optimal Algorithm ◽  
Scheduling Algorithm ◽  
Round Robin ◽  
Cpu Scheduling ◽  
Time Quantum ◽  
Turn Around Time ◽  
Dynamic Time ◽  
Burst Time

After studying various CPU scheduling algorithms in Operating System, Round Robin scheduling algorithm is found to be most optimal algorithm in timeshared systems because of the static time quantum that is designated for every process. The efficacy of Round Robin algorithm entirely depends on the static time quantum that is being selected. After studying and analyzing Round Robin algorithm, I have proposed a new modified Round Robin algorithm that is based on shortest remaining burst time which has resulted in dynamic time quantum in place of static time quantum. This improves the performance of existing algorithm by reducing average waiting time and turn-around time and minimizing the number of context switches.

scholarly journals Enhanced Round-Robin Algorithm in the Cloud Computing Environment for Optimal Task Scheduling

Computers ◽  
2021 ◽  
Vol 10 (5) ◽  
pp. 63
Author(s):  
Fahd Alhaidari ◽  
Taghreed Zayed Balharith
Keyword(s):  
Cloud Computing ◽  
Task Scheduling ◽  
Critical Role ◽  
Turnaround Time ◽  
Round Robin ◽  
Computing Systems ◽  
Time Quantum ◽  
Dynamic Time ◽  
High Level ◽  
Level Performance

Recently, there has been significant growth in the popularity of cloud computing systems. One of the main issues in building cloud computing systems is task scheduling. It plays a critical role in achieving high-level performance and outstanding throughput by having the greatest benefit from the resources. Therefore, enhancing task scheduling algorithms will enhance the QoS, thus leading to more sustainability of cloud computing systems. This paper introduces a novel technique called the dynamic round-robin heuristic algorithm (DRRHA) by utilizing the round-robin algorithm and tuning its time quantum in a dynamic manner based on the mean of the time quantum. Moreover, we applied the remaining burst time of the task as a factor to decide the continuity of executing the task during the current round. The experimental results obtained using the CloudSim Plus tool showed that the DRRHA significantly outperformed the competition in terms of the average waiting time, turnaround time, and response time compared with several studied algorithms, including IRRVQ, dynamic time slice round-robin, improved RR, and SRDQ algorithms.

scholarly journals Super Smart Optimized Round Robin

2016 ◽  
Vol 2 (2) ◽  
pp. 19-21
Author(s):  
Achmad Teguh Wibowo
Keyword(s):  
Waiting Time ◽  
Turnaround Time ◽  
Round Robin ◽  
Priority Scheduling ◽  
Average Waiting Time ◽  
First Come First Serve ◽  
Time Average ◽  
Average Turnaround Time

Aspek penting dalam sistem operasi adalah multiprogramming. Multiprogramming adalah proses atau metode yang digunakan untuk mengekssekusi beberapa proses secara bersamaan dalam memori. Tujuan utamanya adalah untuk meminimalkan Average Waiting Time, Average Turnaround Time, dan memaksimalkan penggunaan CPU. Ada berbagai algoritma yang digunakan dalam multiprogramming seperti First Come First Serve (FCFS), Shortest Job First (SJF), Priority Scheduling (PS) dan Round Robin(RR). Diantara semua itu yang paling sering digunakan adalah Round Robin. Round Robin merupakan algoritma penjadwalan yang optimal dengn sistem timeshared. Dalam RR, waktu kuantum bersifat statis dan algoritma ini bergantung pada besarnya kuantum yang dipilih/digunakan. Kuantum inilah yang berpengaruh pada Average Waiting Time dan Average Turnaround Time nantinya. Tujuan dari makalah ini adalah mengusulkan algoritma yang lebih baik daripada Round Robin sederhana dan Smart Optimized Round Robin sebelumnya.

scholarly journals Comparative performance analysis of optimized round robin scheduling(ORR) using dynamic time quantum with round robin scheduling using static time quantum in Real Time System

2019 ◽  
Vol 8 (12) ◽  
pp. 24890-24893
Author(s):  
Pallab Banerjee ◽  
Biresh Kumar ◽  
Amarnath Singh ◽  
Rahul Kumar ◽  
Ritik Kumar
Keyword(s):  
Task Scheduling ◽  
Turnaround Time ◽  
Round Robin ◽  
Comparative Performance ◽  
Real Time System ◽  
Optimum Utilization ◽  
Time Quantum ◽  
Scheduling Method ◽  
Dynamic Time ◽  
Average Turnaround Time

One of major component of operating system is task scheduling for the optimum utilization of the resources. Round Robin had been an effective task scheduling method so far, but it has certain limitations. It uses static time quantum which sometimes leads to starvation.  The proposed Optimised Round Robin is a modified version of the existing Round Robin scheduling which results in better average time and average turnaround time and overall increase in the performance. The comparative analysis is being done that indicates ORR gives improvement in the system performance.

scholarly journals Improved Round Robin Scheduling using Dynamic Time Quantum

2012 ◽  
Vol 38 (5) ◽  
pp. 34-38 ◽  
Author(s):  
Debashree Nayak ◽  
Sanjeev Kumar Malla ◽  
Debashree Debadarshini
Keyword(s):  
Round Robin ◽  
Time Quantum ◽  
Dynamic Time
Sign in / Sign up

Export Citation Format

Share Document