Abstract:

I.Abstract : 

This paper describes the visualization of classical CPU process scheduling algorithms used in operating systems such as First-Come-First-Served (FCFS), Shortest Job First (SJF), 

Shortest Remaining Time First 

(SRTF), Priority Scheduling, and Round Robin (RR). The behavior and performance implications of these algorithms are usually difficult to fully grasp when learned through equations and tables alone. Visualization techniques and, more specifically, Gantt charts and an interactive timeline simulation allow for an intuitive understanding of process execution order, waiting time, preemption, and CPU utilization. This paper addresses some design goals and implementation

details of a visualization tool that allows learners and researchers to modify interactive process parameters and observe the resulting changes in the schedule. Such a visual approach enhances conceptual understanding, supports algorithm comparison, and facilitates trade-off investigations among fairness, response time, throughput, and starvation. In all, visualization emerges as a good technique to learn and analyze scheduling algorithms.

Keywords: process scheduling, visualization, Gantt chart, operating systems, Round Robin, SJF** process scheduling, visualization, Gantt chart, 

operating systems, Round Robin, SJF