Shortest seek first: Difference between revisions
Adding local short description: "Disk access scheduling algorithm" (Shortdesc helper) |
Add citation |
||
| Line 1: | Line 1: | ||
{{short description|Disk access scheduling algorithm}} |
{{short description|Disk access scheduling algorithm}} |
||
{{ |
{{Refimprove|date=April 2021}} |
||
'''Shortest seek first''' (or '''shortest seek time first''') is a [[disk storage|secondary storage]] [[I/O scheduling|scheduling]] algorithm to determine the motion of the disk's arm and head in servicing read and write requests.''' |
'''Shortest seek first''' (or '''shortest seek time first''') is a [[disk storage|secondary storage]] [[I/O scheduling|scheduling]] algorithm to determine the motion of the disk's arm and head in servicing read and write requests.''' |
||
| Line 14: | Line 14: | ||
The shortest seek first algorithm has the direct benefit of simplicity and is clearly advantageous in comparison to the FIFO method, in that overall arm movement is reduced, resulting in lower average response time. |
The shortest seek first algorithm has the direct benefit of simplicity and is clearly advantageous in comparison to the FIFO method, in that overall arm movement is reduced, resulting in lower average response time. |
||
However, since the buffer is always getting new requests, these can skew the service time of requests that may be farthest away from the disk head's current location, if the new requests are all close to the current location; in fact, [[Resource starvation|starvation]] may result, with the faraway requests never being able to make progress. |
However, since the buffer is always getting new requests, these can skew the service time of requests that may be farthest away from the disk head's current location, if the new requests are all close to the current location; in fact, [[Resource starvation|starvation]] may result, with the faraway requests never being able to make progress.<ref name="TanenbaumBos2015">{{cite book|author1=Andrew S. Tanenbaum|author2=Herbert Bos|title=Modern Operating Systems|url=https://books.google.com/books?id=9gqnngEACAAJ|year=2015|publisher=Pearson|isbn=978-0-13-359162-0}}</ref> |
||
The [[elevator algorithm]] is one way of reducing arm movement/response time, and ensuring consistent servicing of requests. |
The [[elevator algorithm]] is one way of reducing arm movement/response time, and ensuring consistent servicing of requests. |
||
==References== |
|||
{{Reflist}} |
|||
{{DEFAULTSORT:Shortest Seek First}} |
{{DEFAULTSORT:Shortest Seek First}} |
||
Revision as of 13:21, 10 April 2021
 | This article needs additional citations for verification. (April 2021) |
Shortest seek first (or shortest seek time first) is a secondary storage scheduling algorithm to determine the motion of the disk's arm and head in servicing read and write requests.
Description
This is a direct improvement upon a first-come first-served (FCFS) algorithm. The drive maintains an incoming buffer of requests, and tied with each request is a cylinder number of the request. Lower cylinder numbers indicate that the cylinder is closer to the spindle, while higher numbers indicate the cylinder is farther away. The shortest seek first algorithm determines which request is closest to the current position of the head, and then services that request next.
Analysis
The shortest seek first algorithm has the direct benefit of simplicity and is clearly advantageous in comparison to the FIFO method, in that overall arm movement is reduced, resulting in lower average response time.
However, since the buffer is always getting new requests, these can skew the service time of requests that may be farthest away from the disk head's current location, if the new requests are all close to the current location; in fact, starvation may result, with the faraway requests never being able to make progress.[1]
The elevator algorithm is one way of reducing arm movement/response time, and ensuring consistent servicing of requests.
References
- ^ Andrew S. Tanenbaum; Herbert Bos (2015). Modern Operating Systems. Pearson. ISBN 978-0-13-359162-0.
 | This computing article is a stub. You can help Wikipedia by expanding it. |