Simulation of Priority Round Robin Scheduling Algorithm

2012

The main objective of this paper is to develop a new approach for round robin C P U scheduling a l g o r i t h m which improves the performance of CPU in real time operating system. The proposed Priority based Round-Robin CPU Scheduling algorithm is based on the integration of round-robin and priority scheduling algorithm. It retains the advantage of round robin in reducing starvation and also integrates the advantage of priority scheduling. The proposed algorithm also implements the concept of aging by assigning new priorities to the processes. Existing round robin CPU scheduling algorithm cannot be implemented in real time operating system due to their high context switch rates, large waiting time, large response time, large turnaround time and less throughput. The proposed algorithm improves all the drawbacks of round robin C P U scheduling algorithm. The paper also presents the comparative analysis of proposed algorithm with existing round robin scheduling algorithm on the basis...

2013

Abstract- The main objective of this paper is to develop a new approach for round robin C P U scheduling a l g o r i t h m which improves the performance of CPU in real time operating system. The proposed Priority based Round-Robin CPU Scheduling algorithm is based on the integration of round-robin and priority scheduling algorithm. It retains the advantage of round robin in reducing starvation and also integrates the advantage of priority scheduling. The proposed algorithm also implements the concept of aging by assigning new priorities to the processes. Existing round robin CPU scheduling algorithm cannot be implemented in real time operating system due to their high context switch rates, large waiting time, large response time, large turnaround time and less throughput. The proposed algorithm improves all the drawbacks of round robin C P U scheduling algorithm. The paper also presents the comparative analysis of proposed algorithm with existing round robin scheduling algorithm on...

One of the most important components of the computer resource is the CPU. CPU scheduling involves a careful examination of pending processes to determine the most efficient way to service the requests. CPU scheduling is the basis of multiprogrammed operating systems. Most CPU scheduling algorithms concentrate on maximizing CPU utilization and throughput and minimizing turnaround time, waiting time, response time and number of context switching for a set of requests. Some of the popular CPU scheduling algorithms are First-Come-First-Served (FCFS), Shortest Job First (SJF), Priority Scheduling and Round Robin (RR). FCFS is the simplest form of CPU scheduling algorithm. This algorithm is simple to implement, but it generally does not provide the fastest service. Round Robin being the most popular choice in time shared system, but it may not be suitable for real time systems because of larger waiting time, turnaround time and more number of context switches. This paper describes an improvement in RR. A simulator program has been designed and tested the Improved Round Robin (IRR). After improvement in RR it has been found that the waiting time and turnaround time have been reduced drastically.

International Journal of Electrical and Computer Engineering (IJECE)

This paper introduce a new approach for scheduling algorithms which aim to improve real time operating system CPU performance. This new approach of CPU Scheduling algorithm is based on the combination of round-robin (RR) and Priority based (PB) scheduling algorithms. This solution maintains the advantage of simple round robin scheduling algorithm, which is reducing starvation and integrates the advantage of priority scheduling. The proposed algorithm implements the concept of time quantum and assigning as well priority index to the processes. Existing round robin CPU scheduling algorithm cannot be dedicated to real time operating system due to their large waiting time, large response time, and large turnaround time and less throughput. This new algorithm improves all the drawbacks of round robin CPU scheduling algorithm. In addition, this paper presents analysis comparing proposed algorithm with existing round robin scheduling algorithm focusing on average waiting time and average turnaround time.

SinkrOn

In this journal, discussion is given to analyse the improved round robin algorithm more thoroughly. Round robin algorithm plays a significant role to be used in embedded systems. Round robin algorithm usually applied in real-time systems. Here, three case studies are given, and also the analysis of each case study. Comparisons are given about the average turn around time and average waiting time, also number of context switching between the three case studies. Improved round robin algorithm, is a modification from the generic round robin algorithm. In improved round robin algorithm if the remaining burst time is less than the time slice that is allocated, then the currently running process is continue to be executed. Then finish the currently running process from ready queue and execute the next ready queue. Three case studies are given with three different time quantum, which are 3, 4, and 5 ms. The result of this case study analysis is that, the efficiency of the quantum 5 ms is t...

Process management is considered as an important function in the operating system where several scheduling algorithms are used to maintain it. Round Robin is one of the most conventional CPU scheduling algorithms which is frequently used in operating system. The performance of round robin algorithm differs on the choice of time quantum which is clarified by the researchers. In this paper, a new round robin scheduling algorithm has been proposed where time quantum is selected dynamically. An experimental evaluation has been conducted to evaluate the performance of the proposed algorithm. Also a comparative analysis has been performed where the obtained result of this proposed algorithm has been compared with some existing algorithms. The experimental result shows that the performance of the proposed algorithm performs much better than some mentioned algorithms in terms of average waiting time and average turnaround time.

Process management is one of the important tasks performed by the operating system. The performance of the system depends on the CPU scheduling algorithms. The main aim of the CPU scheduling algorithms is to minimize waiting time, turnaround time, response time and context switching and maximizing CPU utilization. First-Come-First-Served (FCFS) Round Robin (RR), Shortest Job First (SJF) and, Priority Scheduling are some popular CPU scheduling algorithms. In time shared systems, Round Robin CPU scheduling is the preferred choice. In Round Robin CPU scheduling, performance of the system depends on the choice of the optimal time quantum. This paper presents an improved Round Robin CPU scheduling algorithm coined enhancing CPU performance using the features of Shortest Job First and Round Robin scheduling with varying time quantum. The proposed algorithm is experimentally proven better than conventional RR. The simulation results show that the waiting time and turnaround time have been reduced in the proposed algorithm compared to traditional RR.

In this paper we have proposed a improvised version of Round Robin Scheduling Algorithm by calculating Dynamic Time Quantum (DTQ) and taking into consideration the priorities assigned with the processes. We have compared the performance of the proposed Advanced Priority Based Dynamic Round Robin Scheduling Algorithm (APBDRR) with the performances of Round Robin Algorithm (RR), Improved Shortest Remaining Burst Round Robin Algorithm (ISRBRR) and Efficient Dynamic Round Robin Algorithm (EDRR). Experimental results show that the proposed algorithm performs better than these algorithms in terms of Average Waiting Time(AWT) and Average Turnaround Time(ATAT).

In this paper, we have made a comprehensive study of variants of Round Robin (RR) scheduling algorithm existing in the literature for Real Time Operating System (RTOS). As per our knowledge there is no known efficient RR scheduling algorithm for Hard RTOS. Our study has been focused on a recently developed algorithm, known as Priority Based Dynamic Round Robin (PBDRR) scheduling algorithm. We have proposed a novel variant of PBDRR algorithm using deadline, which we call as PBDRRD algorithm. This algorithm can be efficiently used for Hard RTOS. We have made comparative performance evaluation of two algorithms i.e. PBDRR and PBDRRD by considering three cases of the input data set. We have computed the average turnaround time, average waiting time and number of context switches for both the algorithms using Gantt chart. Our experimental results show that performance of PBDRRD algorithm is better than that of PBDRR algorithm in all the three cases.

CPU scheduling algorithms are the main factor for performance of multitasking operating system. Where CPU is the main computer resource and round robin algorithm is mainly used as a CPU scheduling algorithm. This is the drawbacks like more perspective switches, higher average waiting time, and higher turnaround time of Simple Round Robin Scheduling algorithm which quantum repeatedly selecting according to the no of processes by arranging a processes in rising order. Based on the experiments and calculation that in this thesis the new modified algorithm solve the fix time quantum problem which considered a challenge for round robin algorithm. The use of this scheduling algorithm increased the performance and constancy of the operating system, which means that the system is who will adapt itself to the requirements Robin Algorithm , This reduces the drawbacks like more is used for the time sharing system In this thesis a new proposed variant of this algorithm presented, elaborate in detail, tested and verified. The new proposed algorithm called Modified Round Robin based on a new method called modified time quantum; the concept of this approach is to make the time context switches higher average waiting time, and higher turnaround time of Simple Round Robin Scheduling algorithm which is used for the time sharing system. This is used for high throughput of the system. When throughput is high then the system performance will increase. This research is useful in the future with the arrival time of the jobs.