Experimental Analysis of New Fair-Share Scheduling Algorithm with Weighted Time Slice for Real Time Systems
|H.S. Behera*, Rakesh Mohanty, Jajnaseni Panda, Dipanwita Thakur and Subasini Sahoo
Department of Computer Science and Engineering, Veer Surendra Sai University of Technology, Burla, Odisha, India
|Corresponding Author: H.S. Behera, E-mail: [email protected]|
|Related article at Pubmed, Scholar Google|
The performance and efficiency of multitasking operating systems mainly depend upon the used CPU scheduling algorithm. In Time Shared System, Round Robin(RR) scheduling gives optimal solution. But it is not suitable for real time system because it gives more number of context switches, larger waiting and turnaround time. In this paper a new Fair-Share scheduling with weighted time slice is proposed and analyzed which calculates time quantum in each round. Our proposed algorithm is based on a novel approach which makes the time quantum repeatedly adjustable according to the burst time of the currently running processes. This algorithm assigns a weight to each process and the process having the least burst time is assigned the largest weight. The process having largest weight is executed first, then the next largest weight and so on. Experimental analysis shows that our proposed algorithm gives better result, reduces the average waiting time, average turnaround time and number of context switches.