Shortest seek time first

Shortest seek time first

Shortest Seek Time First (SSTF, la búsqueda más corta primero) es un algoritmo de planificación de E/S para dispositivos de bloques (discos duros).

Descripción

Es una mejora directa del algoritmo FIFO para planifición de E/S. La unidad mantiene un buffer de peticiones entrantes, y junto a éstas se añade un número que indica el cilindro al que tienen que acceder. Cuanto más pequeño es el número significa que el cilindro está más cerca del eje.

SSTF determina qué petición está más cerca de la posición actual del cabezal y hace que esa sea la siguiente.

Análisis

SSTF tiene la ventaja de ser un algoritmo muy simple y que mejora claramente el método FIFO en el sentido de que reduce drásticamente el número de saltos que tiene que realizar el cabezal haciendo que el tiempo medio de respuesta se reduzca.

Sin embargo, dado que el buffer siempre está recibiendo nuevas peticiones, las peticiones que hacen referencia a posiciones alejadas del cabezal podrían verse perjudicadas por este método si llegan muchas peticiones cercanas al cabezal. Esto podría terminar provocando inanición en las peticiones de E/S.

Existen diversos algoritmos que solucionan esto. Uno de ellos el algoritmo del ascensor.


Wikimedia foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Mira otros diccionarios:

  • Shortest seek first — is a disk 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 (FIFO) algorithm. The drive maintains an incoming… …   Wikipedia

  • First English Civil War — The First English Civil War (1642–1646) was the first of three wars known as the English Civil War (or Wars ). The English Civil War was a series of armed conflicts and political machinations which took place between Parliamentarians and… …   Wikipedia

  • Shortest path problem — A graph with 6 vertices and 7 edges In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. An example is… …   Wikipedia

  • Elevator algorithm — The elevator algorithm (also SCAN) is a disk 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… …   Wikipedia

  • List of United States Presidents by time in office — This is a list of United States Presidents by time in office. The basis of the list is the difference between dates ; if counted by number of calendar days all the figures would be one greater, with the exception of Grover Cleveland who would… …   Wikipedia

  • SSTF — abbr. Shortest Seek Time First …   Dictionary of English abbreviation

  • List of algorithms — The following is a list of the algorithms described in Wikipedia. See also the list of data structures, list of algorithm general topics and list of terms relating to algorithms and data structures.If you intend to describe a new algorithm,… …   Wikipedia

  • international relations — a branch of political science dealing with the relations between nations. [1970 75] * * * Study of the relations of states with each other and with international organizations and certain subnational entities (e.g., bureaucracies and political… …   Universalium

  • History of Ghana — The Republic of Ghana is named after the medieval West African Ghana Empire,[1] known to the dominant ethnic group the Soninke, as Wagadugu, which roughly translates to Land of Herds. The Empire became known in Europe and Arabia as the Ghana… …   Wikipedia

  • I/O scheduling — For process scheduling, see scheduling (computing). For process management, see process management (computing). Input/output (I/O) scheduling is a term used to describe the method computer operating systems decide the order that block I/O… …   Wikipedia

Compartir el artículo y extractos

Link directo
Do a right-click on the link above
and select “Copy Link”