This Jupyter Notebook (Disk-Scheduling- Simulation.ipynb) simulates and compares the performance of three disk scheduling algorithms: SCAN, C-SCAN, and C-LOOK.

This project implements and visualizes various disk scheduling algorithms using the analogy of elevators in a building. The primary algorithms include FCFS, SSTF, SCAN, LOOK, and their circular ...

Abstract: Disk scheduling algorithms have long been a topic of study in computer science. Many researchers studied the performance of the disk scheduling algorithms. However, perhaps due to the ...

Abstract: The main objective of the paper is to propose new disk scheduling to enhance disk performance. Disk performance management is an escalating important facet of operating system research and ...

Processor speed and memory size are increasing day-by-day several times faster than disk speed. The difference between these two identifies that disk I/O performance could become a very important ...