Simulation System for Performance Analysis of Scheduling Algorithm with Uniprocessor

Abstract

Multiprogramming is used to improve the efficiency of the micro-processor. That is when the currently running process is blocked due to waiting for an I/O event, another process may be scheduled to run. At this moment, the issue of scheduling is involved, deciding which process should be executed by the processor, because usually more than one process may be ready for being scheduled. This paper presents performance analysis for different scheduling algorithms for multi-programming in uniprocessor environment Performance analysis is based on average turn-around time, average waiting time and average ratio or turn-around time to service time. Performance analysis shows that RR requires more waiting time and therefore , increase more turn-around time and turn- around to service time ratio. On the other hand,Short Process Next (SPN),Shortest Remaining Time (SRT) and Highest Response Ratio Next (HRRN) algorithms perform the best.