FIFO (computing and electronics): Difference between revisions

Revision as of 08:14, 31 January 2020

Revision as of 02:28, 29 March 2020

Line 2:

[[File:Fifo queue.png|thumb|350px|Representation of a FIFO (queue) with ''enqueue'' and ''dequeue'' operations.]]

'''FIFO''' is-- an [[acronym]] for '''first in, first out''' -- in computing and in [[systems theory]], is a method for organising andthe manipulatingmanipulation of a data bufferstructure -- often, wherespecifically thea oldest[[buffer (firstdata)| entry,data orbuffer]] 'head'-- ofin thewhich queue,each isearlier-arriving processeditem, first.among Itthose is analogousremaining to processingbe a [[Queueprocessed (dataand structure)|queue]]described, withduring [[first-comethat processing, first-served]] (FCFS)as behaviour:being where the people'head' leaveof the-- queueor in'at the orderhead inof' which-- theythat arrive [[Queue (data structure)|queue]].v

Such processing is analogous to service, or provision, in [[first-come, first-served]] (or FCFS) fashion -- much as occurs when an orderly collection of people, in turn, leave the queue to receive some form of attention (each in the same sequence in which they had arrived at the queue's 'tail').

FCFS is also the [[jargon]] term for the FIFO [[Scheduling (computing)|operating system scheduling]] algorithm, which gives every process [[central processing unit]] (CPU) time in the order in which it is demanded. FIFO's opposite is [[LIFO (computing)|LIFO]], last-in-first-out, where the youngest entry or 'top of the stack' is processed first.<ref name="Kruse">{{cite book|last=Kruse|first=Robert L.|title=Data Structures & Program Design (second edition)|edition=second (hc) textbook|origyear=1984|year=1987|others=Joan L. Stone, Kenny Beck, Ed O'Dougherty (production process staff workers)|publisher=Prentice-Hall, Inc. div. of Simon & Schuster|___location=Englewood Cliffs, New Jersey 07632|isbn=0-13-195884-4|quote="The definition of a finite sequence immediately makes it possible for us to attempt a definition of a list: A 'list' of terms of type T is simply a finite sequence of elements of the set T. ... The only difference among stacks and queues and more general lists is the '''operations''' by which changes or accesses can be made to the list."|pages=[https://archive.org/details/datastructurespr0000krus_n1p0/page/150 150]|url-access=registration|url=https://archive.org/details/datastructurespr0000krus_n1p0/page/150}}</ref> A [[priority queue]] is neither FIFO or LIFO but may adopt similar behaviour temporarily or by default. [[Queueing theory]] encompasses these methods for processing [[data structures]]<nowiki/>, as well as interactions between strict-FIFO queues.

FCFS is also the [[jargon]] term for the FIFO [[Scheduling (computing)|operating system scheduling]] algorithm, which gives every process [[central processing unit]] (CPU) time in the order in which it is demanded. FIFO's opposite is [[LIFO (computing)|LIFO]], last-in-first-out, where the youngest entry or 'top of the stack' is processed first.<ref name="Kruse">{{cite book|last=Kruse|first=Robert L.|title=Data Structures & Program Design (second edition)|edition=second (hc) textbook|origyear=1984|year=1987|others=Joan L. Stone, Kenny Beck, Ed O'Dougherty (production process staff workers)|publisher=Prentice-Hall, Inc. div. of Simon & Schuster|___location=Englewood Cliffs, New Jersey 07632|isbn=0-13-195884-4|quote="The definition of a finite sequence immediately makes it possible for us to attempt a definition of a list: A 'list' of terms of type T is simply a finite sequence of elements of the set T. ... The only difference among stacks and queues and more general lists is the '''operations''' by which changes or accesses can be made to the list."|pages=[https://archive.org/details/datastructurespr0000krus_n1p0/page/150 150]|url-access=registration|url=https://archive.org/details/datastructurespr0000krus_n1p0/page/150}}</ref> A [[priority queue]] is neither FIFO or LIFO but may adopt similar behaviour temporarily or by default. [[Queueing theory]] encompasses these methods for processing [[data structures]]<nowiki/>, as well as interactions between strict-FIFO {{queues.}}

==Computer science==