FIFO (computing and electronics): Difference between revisions

Revision as of 10:48, 5 November 2020

Revision as of 22:06, 8 November 2020

Line 2:

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

'''FIFO''' – an [[acronym]] for '''first in, first out''' – in computing and in [[systems theory]], is a method for organising the manipulation of a data structure – often, specifically a [[buffer (data)| 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]] basis, in the same sequence in which they had arrived at the queue's tail.