Shortest-seek-time-first disk scheduling chooses the nearest remaining track after each service:
133 -> 135 -> 142 -> 157 -> 112 -> 97 -> 91 -> 76 -> 23
The distances are , giving 158 tracks. There are no distance ties along this service sequence.

Ancestors (13)

  1. ii
  2. b
  3. 3
  4. Digital systems, linear algebra, introduction to formal proof (resit)
  5. 2016
  6. Past exam of the year 1 of the computer science course of the University of Oxford
  7. Year 1 of the computer science course of the University of Oxford
  8. Computer science course of the University of Oxford
  9. Undergraduate course of the University of Oxford
  10. Course of the University of Oxford
  11. University of Oxford
  12. List of universities
  13. Home

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