A Hybrid Round Robin Scheduling Mechanism for Process Management

Abstract

Every process which runs in an operating system is processed through multiprogramming, by sharing the processor. Multiprogramming is a capability of the operating system to execute one or a lot of programs in a single processing machine. Multiprogramming's main objective is to optimize the use of CPUs, throughput and minimize average waiting time (AWT), the average turnaround time (ATT), average response time (ART) and the number of context switches (NOC). Multi-programming can be performed by several CPU scheduling algorithms. Most preferable scheduling algorithm among all is Round robin (RR). RR algorithm is mainly depended on time quantum which is stationary. Hence, the proposed work is new approach to the round-robin scheduling algorithm (RR algorithm) with an enhanced time quantum based algorithm. This enhancement of RR algorithm by using dynamic time quantum leads to minimize AWT, ATT, ART and NOC. This approach inherits the properties of Round robin, shortest job first (SJF) algorithm and first come first serve algorithm(FCFS). Therefore, the proposed algorithm is a hybrid round robin scheduling mechanism for process management (HYRR Mechanism). HYRR Mechanism is an innovative scheduling algorithm which reduces ATT, ART, AWT and NOC to the desired levels.

A New Round Robin Algorithm for Task Scheduling in Real-time System

“…Proposed algorithm (MMRR) is compared with Amended Dynamic Round Robin (ADRR) [15], Hybrid Round Robin (HYRR) [17], An efficient Customized Round Robin (EDRR) [16] and Median average Round Robin (MARR) [18]. All of these algorithms are compared with Round Robin algorithm [8] in order to evaluate their performance.…”

“…The same principle applies until all of the processes are finished. In [17], the authors performed an innovative scheduling algorithm to reduce the average of waiting time, turnaround time, response time and number of context switches. It is called a hybrid Round Robin scheduling mechanism (HYRR) for process management.…”

“…Fig. 2 to 7 show the Gantt charts for the algorithms; RR [8], ADRR [15], HYRR [17], EDRR [16], MARR [18] and the proposed algorithm (MMRR). The processes are entered in the ready queue in their order; P1=42, P2=101, P3=135, P4=68 and P5=170.…”

“…Fig. 9 to 14 show the Gantt charts for the algorithms; RR [8], ADRR [15], HYRR [17], EDRR [16], MARR [18] and the proposed algorithm (MMRR).…”

“…Furthermore, the processes are sorted in ascending order of their burst time, and then the proposed algorithm is applied to each process to improve turnaround time, waiting time, and context switch. In comparison to the other RR techniques discussed in this work, the drawbacks of the discussed algorithms like ADRR [15], HYRR [16], EDRR [17] and MARR [18] are that they give a large average waiting time, average turnaround time and number of context switches. The contribution of this work is to: 1-Minimizes average waiting time and average turnaround time.…”