| |||||||||||||
Variations on fair I/O schedulersVariations on fair I/O schedulersPosted Dec 6, 2008 20:53 UTC (Sat) by giraffedata (subscriber, #1954)Parent article: Variations on fair I/O schedulers
The algorithm is often reminiscent of the algorithm used by elevators when dealing with requests coming from different floors to go up or down. This is the reason I/O scheduling algorithms are also called "elevators." Is that how Linux users use the term? If so, I know that's not the reason. The reason would be simple confusion. The classic disk scheduling algorithm is called "elevator" because it is the very algorithm that all primitive elevators use: keep moving in one direction until there is no more work in that direction, then turn around and do the same thing in the other direction. The term was coined to refer to that specific algorithm, not the concept of disk I/O scheduling. It's probably best just to use the term "disk I/O scheduler" for a disk I/O scheduler, to avoid confusion.
(Log in to post comments)
|
|||||||||||||