Home
Introduction
FCFS
SCAN
C-SCAN
EDF
SCAN-EDF
Accurate SCAN-EDF
Group_Sweeping
1.Frage
1.Antwort
2.Frage
2.Antwort
3.Frage
3.Antwort
4.Frage
4.Antwort
5.Frage
5.Antwort
 

bei Fragen: E-mail an:
abed@kom.tu-darmstadt.de

 

 

Disk Scheduling Algorithms

 

    SCAN

    In order to minimize the seek time it first serves all requests in one direction until it does not have any  requests in this direction anymore. The head movement is then reversed and service is continued. SCAN provides a very good seek time because the edge tracks get better service times. Note  that middle tracks still get a better service than edge tracks. When the head movement is reversed, it first serves tracks that have recently been serviced , where the heaviest density of  requests, assuming a uniform disrtibution, is at the other end of the disk.

    </COMMENT>
     

Traditional Disk Scheduling

    More interactive applet: