DISK SCHEDULING ALGORITHM COMPARISON OF FIRST COME FIRST SERVE SCHEDULING AND SHORTEST SEEK TIME FIRST
Abstract
Disk scheduling algorithms play a vital role in operating systems by managing the order in which disk I/O requests are processed. Efficient disk scheduling can significantly improve system performance, reduce average seek time, and enhance the overall response time for read/write operations. This project presents a comparative simulation and analysis of various disk scheduling algorithms, including First-Come First-Served (FCFS), Shortest Seek Time First (SSTF), SCAN, C-SCAN, and LOOK. The aim is to implement these algorithms, evaluate their performance under different workloads, and visualize their behavior through real-time simulations. By taking sample disk request sequences, the project calculates and compares metrics such as total head movement, average seek time, and efficiency.
Full-Text Access Notice
In accordance with the NERD Policy on promoting peer-reviewed publication, public access to the full text of a project, thesis or dissertation is restricted for three years, allowing the author and supervisors sufficient time to pursue peer-reviewed publication.
During this period, researchers with legitimate academic or research purposes may request authorisation directly from the author to enable NERD to release the indexed full texts of the work using the form below.