Inspiration
The inspiration for this project came from observing how operating systems and cloud platforms manage multiple tasks simultaneously. Efficient scheduling is critical in ensuring that jobs are executed in the right order, at the right time, and with optimal resource utilisation. While building this project, I learned the importance of balancing fairness, efficiency, and response time in scheduling algorithms. I explored classical approaches like FCFS (First Come First Serve), SJF (Shortest Job First), and Round Robin, as well as more advanced strategies used in distributed systems.
How I Built It • Designed the scheduling logic using Python for simulation. • Implemented multiple algorithms to compare performance. • Used data structures like queues and priority heaps to manage jobs. • Integrated visualisation to show how jobs are scheduled over time. ⚡ Challenges Faced • Handling edge cases where jobs arrive dynamically. • Ensuring fairness while avoiding starvation in priority scheduling. • Optimising turnaround time and waiting time simultaneously.
Built With
- heaps)-?-matplotlib-(for-visualization)-?-algorithms-(fcfs
- priority
- python-?-data-structures-(queues
- round-robin
- sjf