This is my personal learning draw knowledge maps on disk, and then learn more about the following chart atlas of:
1. The head moving mechanism of FIG
PS: FIG disk disk
2. FCFS scheduling algorithm of FIG disk
3. SSTF disk scheduling algorithm of FIG.
Note : SSTF can lead to starvation of Oh!
SCAN disk scheduling algorithm of FIG. 4.
The disk scheduling algorithms of C-SCAN FIG.
Note : SCAN and C-SCAN always strictly follow the head from one end to the other end.
SCAN : after reaching the end, on the way back to the other end of the response to the request ;
C-SCAN : after reaching the end, returns the other end does not respond to the request on the way, to reach the other side directly .
The disk scheduling algorithm of FIG LOOK and C-LOOK FIG.
Note : LOOK and C-LOOK only need to move to a request can return the distal-most, need not be moved to the end disk oh (SCAN analogy here with the C-SCAN Memory)
6. disk scheduling algorithm comparison table
