Abstrait

PERFORMANCE EVALUATION OF A NEW PROPOSED SHOTREST EXECUTION FIRST DYNAMIC ROUND ROBIN (SEFDRR) SCHEDULING ALGORITHM FOR REAL TIME SYSTEMS

Prof. Rakesh Mohanty, Debapriya Maharana, Swarnaprava Tripathy

Round Robin (RR) scheduling algorithm is not suitable for real time operating system because of high context switch rate, larger waiting time, and larger response time. In this paper, we have proposed a novel improved algorithm which is a variant of RR. Our proposed Shortest execution First Dynamic Round Robin (SEFDRR) algorithm calculates individual time slice for each task in each round. Our Experimental results show that SEFDRR algorithm performs better than Priority Based Simple Round Robin Algorithm (PBSRR) by decreasing the number of context switches, average waiting time, and average turnaround time.