Improvised Priority based Round Robin CPU Scheduling

The Round Robin (RR) CPU scheduling algorithm is a fair scheduling algorithm that gives equal time quantum to all processes. The choice of the time quantum is critical as it affects the algorithm's performance. This paper proposes a new algorithm that further improved on the Improved Round Robin CPU (IRR) scheduling algorithm by Manish and AbdulKadir. The proposed algorithm was implemented and benchmarked against five other algorithms available in the literature. The proposed algorithm compared with the other algorithms, produces minimal average waiting time (AWT), average turnaround time (ATAT), and number of context switches (NCS). Based on these results, the proposed algorithm should be preferred over other scheduling algorithms for systems that adopt RR CPU scheduling.

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.

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.

International Journal of Computer Applications, 2015

CPU scheduling has strong effect on resource utilization as well as overall performance of the system. In order to simulate the behavior of multiple jobs in a multiprogramming computer system needs to be specified. The most important aspect of job scheduling is the ability to create a multi-tasking environment. The intention should be allowed as many as possible running processes at all time in order to make best use of CPU. Round Robin algorithm performs optimally in timeshared systems, but it is not suitable for soft real time systems, because it gives more number of context switches, larger waiting time and larger response time. The main objective of this paper is to improve the previous OMDRRS with calculates intelligent time slice and warps after every round of execution and assumed that all the processes were come at randomly as well as all the processes have priority. In order to simulate the behavior of various CPU scheduling algorithms and to improve Round Robin scheduling algorithm using dynamic time slice concept, we purpose new improved CPU scheduling algorithm called "Optimum Dynamic Round Robin Scheduling" (OMDRR). Our experimental results show that our proposed algorithm performs better in terms of reducing the number of context switch, average waiting time and average turnaround time.

Sinkron

In this journal, simulation of priority round robin scheduling algorithm is presented. To imitate the processes of operating system operation, simulation can be used. By simulation, model is used, namely models that represent the characteristics or behaviour of systems. Process scheduling is one important operation in operating system. OS-SIM can be used to model and simulate the operations of process scheduling. Some scheduling algorithms are available in modern operating systems, like First come First Serve (FCFS), Shortest Job First (SJF), Round Robin (RR), Priority Scheduling or combination of these algorithms. One important scheduling algorithm for real-time or embedded system is priority round robin scheduling algorithm. Priority round robin scheduling algorithm is a preemptive algorithm. Each process is given time quantum. Each process has a priority. Here time quantum 3 is given. The higher the time quantum, the more the context switching. By the use of OS-SIM, simulation ca...

2012

One of the main fundamental function of an operating system is scheduling. There are two types of uni-processor systems in general. Those are uni-programmed and multi-programmed operating systems. In a uniprogrammed operating system only one process is executed at a time, while the remaining process must wait until the CPU is free. In a multi-programmed operating system, it is capable of executing multiple processes concurrently. CPU Scheduling is the basis of multi-programmed operating system. The scheduler is responsible for multiplexing processes on the CPU. There are many scheduling algorithms available for a multi-programmed operating system like FCFS, SJF, Priority, Round Robin etc. In this paper, we mainly focused on a new algorithm called Efficient Round Robin (ERR) algorithm for multi-programmed operating system. In this paper we developed a tool which gives output in the form of experimental results with respect to some standard scheduling algorithms like FCFS, SJF, Priori...

International Journal of Advanced Computer Science and Applications, 2019

Background: This paper proposed a Simplified Improved Dynamic Round Robin (SIDRR) algorithm that further improved on some existing Improvements on Round Robin CPU scheduling algorithms; Most of these improvements on Round Robin rely on arithmetic mean in selecting their Time Quantum (TQ). The arithmetic mean approach does not adequately represent the data. Aim: the aim of this study is to develop a simplified dynamic improved Round Robin CPU scheduling algorithm. Method: this study implemented five existing Round Robin scheduling algorithm using C++. The algorithms are; New Improved Round Robin (NIRR), Dynamic Average Burst Round Robin (DABRR), Improved Round Robin with Varying time Quantum (IRRVQ), Revamped Mean Round Robin (RMRR) and Efficient Dynamic Round Robin (EDRR). A new algorithm was also developed based on the Numeric Outlier Detection technique and geometric mean for dynamic time quantum determination. The proposed algorithm was compared with the five implemented using parameters such as average turnaround time, average waiting time and number of context switching. Results: the result of this study showed that the proposed algorithm performs better than the other five algorithms in terms of Average waiting time, average turnaround time & number of context switches. This study therefore, recommends the adoption of SIDRR for CPU scheduling and other emerging areas such as cloud computing resource allocation.

2013

One of the fundamental function of an operating system is scheduling. There are 2 types of uni-processor operating system in general. Those are uni-programming and multiprogramming. Uni-programming operating system execute only single job at a time while multiprogramming operating system is capable of executing multiple jobs concurrently. Resource utilization is the basic aim of multi-programming operating system. There are many scheduling algorithms available for multi-programming operating system. But our work focuses on design and development aspect of new and novel scheduling algorithm for multi-programming operating system in the view of optimization. We developed a tool which gives output in the form of experimental results with respect to some standard and new scheduling algorithms e.g. First come first serve, shortest job first, round robin, optimal and a novel cpu scheduling algorithm etc.

International Journal of Computer Applications, 2014

CPU is a primary computer resource. So, its scheduling is central to operating system design. To improve both utilization and the speed of CPU we need to keep several processes in memory at a time that means we use the sharing and multiprogramming concepts. CPU scheduling determines which process run when there are multiple runnable processes CPU scheduling is necessary because it has a big effect on resources utilization and overall performance of the system. In this paper, we are giving an improved CPU Scheduling algorithm.

International Journal of Advanced Research (IJAR), 2019

CPU scheduling is one of the basic factors for performance measure of multitasking operating system which makes a commuter system more productive by switching the CPU among the processes. The performance of the CPU scheduling algorithms depends on minimizing waiting time, response time, turnaround time and context switching, and maximizing CPU utilization. Round Robin (RR) is the most widely used CPU scheduling algorithm in multitasking operating system. The efficiency of a multitasking systemcomprising with Round Robin CPU scheduling relies onthe selection of the optimal time quantum. If the time quantum is longer, the response time of the processes becomes too high. On the other hand, the shorter time quantum raises the amount of context switch among the processes. In this paper, a modified CPU scheduling algorithm, called Round Robin with Dynamic Time Quantum (RRDTQ) is introduced for enhancing CPU performance using dynamic time quantum with RR. This time quantum is calculated from the burst time of the set of waiting processes in the ready queue. The experimental results show that the proposed algorithm solves the fixed time quantum problem and decreases the average waiting time and turnaround time compared to traditional RR algorithm.

2015

CPU scheduling is one of the most crucial operations performed by operating systems. Different conventional algorithms like FCFS, SJF, Priority, and RR (Round Robin) are available for CPU Scheduling. The effectiveness of Priority and Round Robin scheduling algorithm completely depends on selection of priority features of processes and on the choice of time quantum. In this paper a new CPU scheduling algorithm has been proposed, named as CSPDABRR (Characteristic specific Prioritized Dynamic Average Burst Round Robin), that uses seven priority features for calculating priority of processes and uses dynamic time quantum instead of static time quantum used in RR. The performance of the proposed algorithm is experimentally compared with traditional RR and Priority scheduling algorithm in both uni-processor and multi-processor environment. The results of our approach presented in this paper demonstrate improved performance in terms of average waiting time, average turnaround time, and optimal priority feature.

Journal of Information Processing Systems, 2017

The round robin algorithm is regarded as one of the most efficient and effective CPU scheduling techniques in computing. It centres on the processing time required for a CPU to execute available jobs. Although there are other CPU scheduling algorithms based on processing time which use different criteria, the round robin algorithm has gained much popularity due to its optimal time-shared environment. The effectiveness of this algorithm depends strongly on the choice of time quantum. This paper presents a new effective round robin CPU scheduling algorithm. The effectiveness here lies in the fact that the proposed algorithm depends on a dynamically allocated time quantum in each round. Its performance is compared with both traditional and enhanced round robin algorithms, and the findings demonstrate an improved performance in terms of average waiting time, average turnaround time and context switching.

2020

Quite a number of scheduling algorithms have been implemented in the past, including First Come First Served (FCFS), Shortest Job First (SJF), Priority and Round Robin (RR). However, RR seems better than others because of its impartiality during the usage of its quantum time. Despite this, there is a big challenge with respect to the quantum time to use. This is because when the quantum time is too large, it leads to FCFS, and if the quantum time is too short, it increases the number of switches from the processes. As a result of this, this paper provides a descriptive review of various algorithms that have been implemented in the past 10 years, for various quantum time in order to optimize the performance of CPU utilization. This attempt will open more research areas for researchers, serve as a reference source and articulate various algorithms that have been used in the previous years – and as such, the paper will serve as a guide for future work. This research work further sugges...

Applied Sciences

Minimizing time cost in time-shared operating system is the main aim of the researchers interested in CPU scheduling. CPU scheduling is the basic job within any operating system. Scheduling criteria (e.g., waiting time, turnaround time and number of context switches (NCS)) are used to compare CPU scheduling algorithms. Round robin (RR) is the most common preemptive scheduling policy used in time-shared operating systems. In this paper, a modified version of the RR algorithm is introduced to combine the advantageous of favor short process and low scheduling overhead of RR for the sake of minimizing average waiting time, turnaround time and NCS. The proposed work starts by clustering the processes into clusters where each cluster contains processes that are similar in attributes (e.g., CPU service period, weights and number of allocations to CPU). Every process in a cluster is assigned the same time slice depending on the weight of its cluster and its CPU service period. The authors p...

Process scheduling means allocating a certain amount of CPU time to each of the user Processes. This paper proposes a CPU Scheduling algorithm, which is meant for optimizing CPU scheduling for real time applications. It is a new approach, which uses the concept of Mean Difference Round Robin (MDRR) with dynamic time quantum, whose value changes for each cycle. It acts better than RR and Mean Difference Round Robin (MDRR) Algorithm in terms of reducing the number of context switches, average waiting time and average turnaround time. The experimental results of the proposed algorithm have been compared with Mean-Difference Round Robin (MDRR) Algorithm is found to have produced optimum scheduling.