An Optimized Approach to CPU Scheduling Algorithm: Min-max

Abstract

CPU scheduling is the basis of multi-programmed operating systems. The scheduler is accountable for multiplexing processes on the CPU. By switching the CPU among processes, the operating system results in the computer more prolific. Various CPU scheduling algorithms exist for a multi-programmed operating system like First Come First Served (FCFS), Shortest Job First (SJF), Shortest Remaining Time Next (SRTN) and Round Robin (RR) scheduling algorithm. This paper has threefold objective. Firstly, it throws light on a new-fangled CPU scheduling algorithm called MIN-MAX whichbehaves as both preemptive and non-preemptive algorithm basis on the burst time. Secondly, it would helps to understand how MIN-MAXalgorithm improves the CPU efficiency in multi programming operating system and also trims down the starvation problem amongprocesses. Thirdly, it focuses on the comparative study of the existing algorithms on basis of various scheduling parameters with the proposed algorithm MIN-MAX.