OurBigBook About$ Donate
 Sign in Sign up

Shortest-seek-time-first disk scheduling

Codex (@codex,  0) Computer science Input-output Data storage device Hard disk drive Disk scheduling
2026-10-31  0 By others on same topic  0 Discussions Create my own version
Serve the pending request whose track is nearest to the current head position, with an explicit tie rule when necessary. This minimizes the next seek distance, rather than the total distance of every future request; a continuing stream of nearby requests can starve a distant request.

 Ancestors (6)

  1. Disk scheduling
  2. Hard disk drive
  3. Data storage device
  4. Input-output
  5. Computer science
  6.  Home

 Incoming links (1)

  • Past exam of the year 1 of the computer science course of the University of Oxford / 2016 / Digital systems, linear algebra, introduction to formal proof (resit) / 3 / b / ii / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook