Description: Shortest seek first-come, first serve, priority and elevator scheduling method for following a given set of disk access scheduling. Required to give the order of disk access for each algorithm to calculate the average number of mobile Road. (Read-write head 90, the move to the direction of increase in track number)
To Search:
File list (Check if you may need any files):
cipandiaodu.cpp
Download