A Proposed Priority Dynamic Quantum Time Algorithm to Enhance Varying Time Quantum Round Robin Algorithm
Management of the processes is an essential task performed by the scheduler in an Operating System (OS). One of the important units of the OS is Central Processing Unit (CPU), which is scheduling by many algorithms of scheduling. The main purpose of these algorithms is to enhance the system's p...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
Inderscience
2016
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/14976/ http://umpir.ump.edu.my/id/eprint/14976/ http://umpir.ump.edu.my/id/eprint/14976/ http://umpir.ump.edu.my/id/eprint/14976/1/A%20Proposed%20Priority%20Dynamic%20Quantum%20Time%20Algorithm%20to%20Enhance%20Varying%20Time%20Quantum%20Round%20Robin%20Algorithm.pdf http://umpir.ump.edu.my/id/eprint/14976/7/IJCAT540304_Mohammed%20et%20al%20PUBLISHED.pdf |
| Summary: | Management of the processes is an essential task performed by the scheduler in an Operating System (OS). One of the important units of the OS is Central Processing Unit (CPU), which is scheduling by many algorithms of scheduling. The main purpose of these algorithms is to enhance the system's performance by increasing the utilisation of CPU, increasing the throughput of the system, reducing the turnaround and waiting times and reducing the context switches. Some of the famous scheduling algorithms are First-Come, First-Served, Shortest Job First (SJF), Round Robin (RR) and Priority Scheduling. RR scheduling algorithm is the most suitable choice for time shared system but not for soft real-time systems owing to a large turnaround time, large waiting time and high number of context switches. The choice of the quantum time in RR is the optimal solution for the problem of large turnaround and waiting time with RR. This paper proposes a new algorithm to improve the work of RR by proposing a new algorithm to improve the concept of Improved Round Robin with Varying time Quantum (IRRVQ). The proposed algorithm gave results better than IRRVQ in terms of minimising the number of context switches, average waiting time and average turnaround time. |
|---|