Preemptive Scheduling Shortest Remaining Time (SRT) & Round Robin (RR)

Disclaimer: All content has been created by students in partial fulfillment of the requirements for SECR2043.

🎥 Preemptive Scheduling: SRTF & Round Robin Simulation | SECR2043 Operating Systems Project

Welcome to our video presentation for the SECR2043 Operating Systems course!
In this project, we explore Preemptive CPU Scheduling with a focus on:

🔹 Shortest Remaining Time First (SRTF)
🔹 Round Robin (RR)

Through interactive p5.js simulations, we demonstrate how both algorithms handle multiple processes in real time. You'll see:

✅ Step-by-step visualizations of each algorithm
✅ Gantt chart execution timelines
✅ Execution tables showing burst, arrival, and remaining times
✅ Comparisons of waiting time and turnaround time

📌 Process Set Used:

* P1: Arrival = 0, Burst = 8
* P2: Arrival = 1, Burst = 4
* P3: Arrival = 2, Burst = 2
* P4: Arrival = 3, Burst = 1

📊 Key Insights:

* SRTF minimizes average waiting time but may cause starvation.
* RR ensures fairness and is better for time-sharing systems.
* Visual simulation helps bridge theory and practical understanding.

👥 Presented by: Group 5
📚 Course: SECR2043 – Operating Systems
🎓 Institution: UTMSPACE

#OperatingSystems #SchedulingAlgorithms #SRTF #RoundRobin #p5js #CPUScheduling #SECR2043 #ComputerScience

Видео Preemptive Scheduling Shortest Remaining Time (SRT) & Round Robin (RR) канала mamuPenang