Authors: Jacob Sibin, SRM Institute of Science & Technology, Tiruchirappalli
| One of the most important things an operating system does is CPU scheduling, which controls how long each process can use the CPU.this paper teaches us about how to construct a visualizer that can be helpful in teaching how operating systems work. the visualizer will help you with scheduling algorithms like Round Robin, FCFS and SJF.it can also build Gantt Charts that update as jobs are finished. one of the most cursial things a operating system performs this control the CPU. the system has to decide which of the many processes that are waiting should be getting CPU time and for how long. This paper discusses a CPU Scheduling Algorithm Visualizer designed to enhance students' comprehension of real-time processes. This device can employ a lot of different algorithms, such as Round Robin, First Come First Serve (FCFS), and Shortest Job First (both are pre emptive and non pre-emptive). The program produces Gantt charts that you can use and shows you how long it takes to wait and how long it takes to turn around. The visualizer explains how algorithms work one step at a time and how they are different from each other. This makes it simple to tell them apart and understand how they affect the performance of a process. Tests with sample process sets suggest that this gadget can assist teach because it can put abstract ideas about scheduling into graphics that people can understand |
Keywords: CPU scheduling,Gantt charts,FCFS,SJF,round robin,visualization,operating systems
Published in: 2024 Asian Conference on Communication and Networks (ASIANComNet)
Date of Publication: --
DOI: -
Publisher: IEEE