INTRODUCTION TO CPU SCHEDULING ALGORITHMS

Extending the concept of round robin algorithm (rr) to incorporate user or system defined priority and consider the case of different arrival times of process and suggesting a novel approach that minimizes context switching overhead, average waiting time and turnaround time. approach: we calculate optimum priority ´op´ for each process which determines the order of execution of processes, optimum service time ´ost´ for each process which determines time of execution of process in a single round and execute the processes in rr fashion using the calculated parameters. results: based on experiments and calculations, the proposed algorithm is successful in reducing afore mentioned problems. conclusion: our proposed algorithm can be effective in priority based systems where burst time and arrival time can be easily predicted.