FIFO (computing and electronics): Difference between revisions

Revision as of 08:42, 10 May 2021

Revision as of 09:26, 25 October 2021

Line 3:

[[file:Data Queue.svg|thumb|Representation of a FIFO queue]]

In computing and in [[systems theory]], '''FIFO''' (an [[acronym]] for '''first in, first out''' (the first in is the first out) is a method for organising the manipulation of a data structure (often, specifically a [[data buffer]]) where the oldest (first) entry, or "head" of the [[Queue (data structure)|queue]], is processed first.

Such processing is analogous to servicing people in a [[queue area]] on a [[first-come, first-served]] (FCFS) basis, i.e. in the same sequence in which they arrive at the queue's tail.