Abstract: The essential and important aspect of operating system is multiprogramming. Multiprogramming is a process or method of executing multiple processes simultaneously in the memory. Its main aim to minimize the average waiting time, average turnaround time and maximize the CPU utilization. There are various CPU scheduling algorithms are used to performed multiprogramming like First Come First Serve (FCFS), Shortest Job First (SJF), Priority Scheduling (PS) and Round Robin(RR).The most widely used scheduling algorithm is Round robin scheduling among all of them. It is an optimal CPU scheduling algorithms in timeshared systems.
This paper presents a new approach that will help to reduce the average waiting time and turnaround time. The proposed algorithm is also compared with various variants of Round Robin algorithm. It produces minimal average waiting time and average turnaround time. In this approach we use mean and median to calculate the time quantum which will improve the effectiveness of the algorithm.
Keywords: Context switching, CPU scheduling, Gantt chart, Round Robin CPU scheduling algorithm, Turnaround time, Waiting time, Context Switches.
Title: Median Based Round Robin CPU Scheduling Algorithm
Author: Dolly Khokhar, Mr Ankur Kaushik
International Journal of Computer Science and Information Technology Research
ISSN 2348-1196 (print), ISSN 2348-120X (online)
Research Publish Journals
