Scheduling is the technique used for controlling the order of the job which is to be performed by a CPU of a computer. The motive of scheduling is to engage the CPU at its maximum capacity and no process shall wait for longer time and to finish the entire task in minimum possible time. In this paper, we discuss various types of Scheduling algorithms and Compare their performance on terms of throughput and waiting time. The four basic type of Scheduling are: First Come First Served (FCFS), Shortest Job First (SJF), Round Robin (RR) scheduling, & Priority Based scheduling. All these algorithms have some drawback and have not been optimized. In this paper we propose a Median based Time quantum based scheduling algorithm which is combination of SJF & RR where all the jobs in the queue are first aligned as per their burst time in ascending order and them Round robin is applied for improving the performance.
[1]
D. Meziat,et al.
Deficit Round Robin Alternated : A New Scheduling Algorithm
,
2002
.
[2]
Karim Faez,et al.
An Intelligent MLFQ Scheduling Algorithm (IMLFQ) with Fault Tolerant Mechanism
,
2006,
Sixth International Conference on Intelligent Systems Design and Applications.
[3]
Yue-Ru Chuang,et al.
A Pipelined Scheduling Strategy for Supporting Variable-Length Packets in WDM Networks
,
2002
.
[4]
Thomas A. Funkhouser,et al.
Partial matching of 3D shapes with priority-driven search
,
2006,
SGP '06.
[5]
Imrich Chlamtac,et al.
Airtime Deficit Round Robin (ADRR) packet scheduling algorithm
,
2008,
2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems.