|HARD DISK SCHEDULING ALGORITHMS|
This Project is Developed in MSc IS I Yr. I sem. as a mini project.
Disks provide the bulk of secondary storage for modern computers. Modern disk drives are addressed as large one dimensional arrays of logical blocks, where the block is the smallest unit of transfer. The size of block is usually 512 bytes.
The one dimensional array of logical blocks is mapped onto the sectors of the disk sequentially. Sector 0 is the first sector of the first track on the outermost cylinder.
The no. of sectors per track has been increasing as disk technology improves, and it is common to have more than 100 sectors per track in the outer zone of a disk.
We can improve both the access time and the bandwidth by Scheduling the servicing of I/O requests in a good order.
Various Disk Scheduling Algorithms,
My Applications demonstrates all the above shcedulings with a neat graphical look and a analysis for the best algorithm and much more.