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

• Shortest seek first — Der Festplatten Scheduler ist Bestandteil von Betriebssystemen und regelt die zeitliche Abfolge (Scheduling) von Lese und Schreibaufträgen an Festplatten. Festplatte: Wohin soll der Kopf zuerst fahren? Folgende Techniken werden verwendet, um eine …   Deutsch Wikipedia

• 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… …   Wikipedia Español

• 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

• 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

• 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

• 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

• 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

• Список алгоритмов — Эта страница информационный список. Основная статья: Алгоритм Ниже приводится список алгоритмов, группированный по категориям. Более детальные сведения приводятся в списке структур данных и …   Википедия

• Ordonnancement d'E/S — Pour les articles homonymes, voir Ordonnancement. L ordonnancement d E/S est le terme utilisé pour décrire la méthode qu un système d exploitation utilise pour décider de l ordre dans lequel les opérations d E/S seront transmises aux disques. L… …   Wikipédia en Français