Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Elevator algorithm
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Disk-scheduling algorithm}} {{Refimprove|date=November 2007}} The '''elevator algorithm''', or '''SCAN''', is a [[hard disk|disk]]-[[I/O scheduling|scheduling]] algorithm to determine the motion of the disk's arm and head in servicing read and write requests. This algorithm is named after the behavior of a building [[elevator]], where the elevator continues to travel in its current direction (up or down) until empty, stopping only to let individuals off or to pick up new individuals heading in the same direction. From an implementation perspective, the [[disk drive|drive]] maintains a [[data buffer|buffer]] of pending read/write requests, along with the associated [[Cylinder (disk drive)|cylinder]] number of the request, in which lower cylinder numbers generally indicate that the cylinder is closer to the spindle, and higher numbers indicate the cylinder is farther away.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)