Novel Scheduling Algorithm for Uni-Processor Operating System
|Saudagar Barade*1 and Nikhil Khande2
|Related article at Pubmed, Scholar Google|
One of the fundamental function of an operating system is scheduling. There are 2 types of uni-processor operating system in general.Those are uni-programming and multi-programming. Uni-programming operating system execute only single job at a time while multiprogramming operating system is capable of executing multiple jobs concurrently. Resource utilization is the basic aim of multi-programming operating system. There are many scheduling algorithms available for multi-programming operating system. But our work focuses on design and development aspect of new and novel scheduling algorithm for multi-programming operating system in the view of optimisation. We developed a tool which gives output in the form of experimental results with respect to some standard scheduling algorithms e.g. First come first serve, shortest job first, round robin etc.