CPU Scheduling Visualizer || CSE323 Project

本站添加: 2026-05-12

[00:00:00]Hello everyone, this is Aisha and today I will present a Python based terminal application that demonstrate how CPU scheduling in algorithms work.

[00:00:11]So my project implements four L key algorithms which are uh first come first serve shortage of first shortest remaining time and round dropping. So now what makes it interesting is that is it it visually represent process execution using a color-coded G chart in the terminal making it easier to understand and compare how each algorithm schedules taskes over time. So these are my Python file which I have used in my projects. So let's run the project.

[00:00:49]Okay, this is the user interface. Uh here I use flat for this UI. And to do any algorithm firstly we have to add process. Now I'm adding the process.

[00:01:18]Okay. So I have added all the process and uh firstly the first FCFS which is first come first ser processor um we know the processes are executed in the order they arrive uh let's run the they arrive the first process gets the CPU first and runs until it finishes and we can see that it's working this way and uh this is the matrix of my FCFS um which shows average waiting time is 3.00 average turn is 5.25 25. Um, and now let's go to the SJF and we know uh SJF is basically the process with the shortest execution execution time is selected next which helps reduce overall waiting time and we can see um and this is the matrix of SJF. Uh the average waiting time is 2 waiting is 2.00 average turn error is 4.25 for the SJF and SRTF. Let's run SRTF. And this is the GAN chart of SRTF.

[00:02:19]Um we can say the this is this this is the primitive version of SJF. The CPU always runs the process with the shortest remaining time. If a proc um if a new process arrives with a shorter remaining time, the current process is paused and the and the new one is executed time first. And we can see that um the mat um and this is the matrix and its average time is waiting is also 2.00 and average is 4.2. 25. Uh let's run round robbing and we set the quantum which is two and round robbing each process gets a fixed time like we set the quantum two after it's done it goes to the back of the qu and if it's not finished ensuring fair CPU in sharing and we can see uh how it's work and this is the matrix of round robin the average waiting is showing 3.50 5 standard only is 5.75 and lastly the system monitor it shows uh the programs which are running in my laptop.

[00:03:22]Yeah, this was it and this was my project. Thank you everyone.