Job scheduling is an elementary characteristic of an operating system. The perception is to have system resources shared by a number of processes. A number of steps need to be performed to execute a program. Instructions and data must be loaded into main memory, I/O devices and files must be initialized, and other resources must be prepared. The efficiency of a system solely is subject to the use of job scheduling algorithm in a multi-programmed system. This paper begins with a brief representation of task or job sets, followed by a discussion about different type of job scheduling algorithms. In addition, the elaboration of comparative study of the entire scheduling algorithm along with proposed work is also given. This manuscript represents the simulation design of proposed CPU scheduling algorithm called MIN-MAX which is both preemptive and non-preemptive in nature. This work encompasses a software tool which produces a wide-ranging simulation of a number of CPU scheduling algorithms and provides the output in the form of scheduling performance metrics. The main objective of the paper is to analyze the performance of different algorithms with the proposed algorithm that results in minimum average waiting time and context switches. The major focus is to improve the system efficiency in multi programming system and also reduces the starvation problem among minimum and maximum burst time processes.

Process Scheduling, First Come First Serve (FCFS), Round Robin (RR), MIN-MAX Algorithm, Simulation Design, Starvation, Complexity Analysis

[1]. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, John Wiley & Sons, Inc., Seventh (7th)Edition, ISBN: 0-471-69466-5, 2005.
[2]. William Stallings, “Operating Systems: Internals and Design Principles”, Sixth (6th) Edition, 2009.
[3]. L. Yang, J. M. Schopf and I. Foster, “Conservative Scheduling: Using predictive variance to improve scheduling decisions in dynamic environments”, In Proceedings of the ACM/IEEE conference on Supercomputing, Page No (15- 31), 2003.
[4]. Milam Milenkovic, “Operating Systems Concepts and Design”, McGraw-Hill, Computer Science Series, Second (2nd) Edition.
[5]. R. J. Matarneh, “Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the Now Running Processes”, American Journal of Applied Sciences, Volume-06, Issue-10, 2009.
[6]. Baer, J. L., “A survey of some theoretical aspects of multiprocessing”, Computing Surveys, Page No (31-80), 1973.
[7]. K. Sukhija, N. Aggarwal and M. Jindal, “An Optimized approach to CPU Scheduling Algorithm: Min-Max”, Journal of Emerging Technologies in Web Intelligence, Volume-06, Issue-04, Page No (420-428), 2014.
[8]. S. Raheja, R. Dhadich and S. Rajpal, “An Optimum time Quantum using Linguistic Synthesis for Round Robin CPU Scheduling Algorithm” , International Journal on Soft Computing , Volume-03, Issue-01, 2012.
[9]. Andrew S. Tanenbaum, and Albert S. Woodfhull, “Operating Systems Design and Implementation”, Second (2nd) Edition, 2005.
[10]. H.H.S. Lee; Lecture: CPU Scheduling, School of Electrical and Computer Engineering, Georgia Institute of Technology.
[11]. E. O. Oyetunji and A. E. Oluleye, “Performance Assessment of Some CPU Scheduling Algorithms”, Research Journal of Information Technology, Volume-01, Issue-01, Page No (22-26), 2009.
[12]. S. Babu, N Priyanka and P.Suresh, “A Novel CPU Scheduling Algorithm–Preemptive &Non-Preemptive”, International Journal of Modern Engineering Research, Volume-02, Issue-06, Page No (4484-4490), 2012.
[13]. L Cherkasova, Diwaker G and A. Vahdat, “Comparison of the Three CPU Schedulers in Xen”, SIGMETRICS Performance Evaluation Review, Volume-35, Issue-02, Page No (42-51), 2007.