A Comparative Study of Various CPU Scheduling Algorithms using MOOS Simulator
Current study represents the implementation of a various scheduling algorithms and developing CPU scheduling algorithms. Examining their impact in practice can be difficult as well as time consuming because of the need to modify their test operating system kernel code and measure the resulting performance on a consistent workload of real applications. As processor is the important resource, CPU scheduling becomes very important in accomplishing the operating system (OS) design goals. The intention should be allowed as many as possible running processes at all times in order to make best use of CPU. This study presents a state diagram that depicts the comparative study of various scheduling algorithms using simulator for a single CPU and shows which algorithm is best for the particular situation. Using this representation, it becomes much easier to understand what is going on inside the system and why a different set of processes is a candidate for the allocation of the CPU at different times. The objective of the study is to analyze the highly efficient CPU scheduler on design of the high-quality scheduling algorithms which suits the scheduling goals.
Keywords: Scheduler, state diagrams, CPU utilization, performance, TAT
Cite this Article
Nilam Choudhary, Geetika Gautam, Yukti Goswami, et al. A Comparative Study of various CPU Scheduling Algorithms using MOOS Simulator. Journal of Advances in Shell Programming. 2018; 5(3): 1–5p.
- There are currently no refbacks.
This site has been shifted to https://stmcomputers.stmjournals.com/