bei Fragen: E-mail an: abed@kom.tu-darmstadt.de
| Disk Scheduling Algorithms |  |
Whereas strictly sequential storage devices (e.g. tapes) do not have a scheduling proble, for random acess storage devices, every file operation may require movement of read-write head. This operation, known as “to seek” is very time consuming. The task of disk management is to reduce such type of operation. |
| Usually the seek time is the largest factor of the actual transfer time. Most systems try to keep the cost of seeking low by applying special algorithms to the scheduling of disk read-write operation.
| The main goals of traditional disk scheduling algorithms are to reduce the cost of seek operatons, to achieve a high throughput and to provide fair disk access for every process.

More interactive applet: