FIFO (computing and electronics)
In computing and in systems theory, FIFO is an acronym for first in, first out (the first in is the first out), a method for organizing the manipulation of a data structure (often, specifically a data buffer) where the oldest (first) entry, or "head" of the 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.
- Comment
- enIn computing and in systems theory, FIFO is an acronym for first in, first out (the first in is the first out), a method for organizing the manipulation of a data structure (often, specifically a data buffer) where the oldest (first) entry, or "head" of the 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.
- Depiction
- Has abstract
- enIn computing and in systems theory, FIFO is an acronym for first in, first out (the first in is the first out), a method for organizing the manipulation of a data structure (often, specifically a data buffer) where the oldest (first) entry, or "head" of the 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. FCFS is also the jargon term for the FIFO 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, last-in-first-out, where the youngest entry or "top of the stack" is processed first. 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, as well as interactions between strict-FIFO queues.
- Hypernym
- Acronym
- Is primary topic of
- FIFO (computing and electronics)
- Label
- enFIFO (computing and electronics)
- Link from a Wikipage to an external page
- www.sunburst-design.com/papers/CummingsSNUG2002SJ_FIFO2.pdf
- Link from a Wikipage to another Wikipage
- Acronym
- Address register
- Bit
- Bit numbering
- C++
- Category:Inter-process communication
- Category:Queue management
- Category:Scheduling algorithms
- Central processing unit
- Circular buffer
- Circular queue
- Computer network
- Data buffer
- Data structures
- Electronics
- Fairchild Semiconductor
- FIFO and LIFO accounting
- File:Data Queue.svg
- File:Fifo queue.png
- File:Fifo schedule.png
- FINO
- First-come, first-served
- Flip-flop (electronics)
- Gray code
- Interprocess communication
- Jargon
- Leaky bucket
- LIFO (computing)
- Linked list
- List (abstract data type)
- Metastability
- Named pipe
- Network bridge
- Network router
- Network switch
- O scheduling
- output
- Pipes and filters
- Pointer (computer programming)
- Priority queue
- Queue (data structure)
- Queue area
- Queueing theory
- Scheduling (computing)
- Standard Template Library
- Static random access memory
- Systems theory
- Thread safe
- Xilinx
- SameAs
- 4419565-5
- 4hmgX
- Fifo
- FIFO
- FIFO
- FIFO
- FIFO
- FIFO
- FIFO
- FIFO
- FIFO
- FIFO
- FIFO
- FIFO
- FIFO
- FIFO (datastruktur)
- FIFO (računarstvo i elektronika)
- FIFO algoritması
- First Come First Served
- First in, first out
- First in, first out (informatique)
- First In First Out
- First In – First Out
- First In – First Out
- m.030hd
- Metoda FIFO
- Metoda FIFO
- Q515636
- Алгоритм заміщення комірок пам'яті FIFO
- נכנס ראשון יוצא ראשון
- خروج به ترتیب ورود (رایانه و الکترونیک)
- 先進先出演算法
- 선입 선출
- Subject
- Category:Inter-process communication
- Category:Queue management
- Category:Scheduling algorithms
- Thumbnail
- WasDerivedFrom
- FIFO (computing and electronics)?oldid=1104188471&ns=0
- WikiPageLength
- 8210
- Wikipage page ID
- 11347
- Wikipage revision ID
- 1104188471
- WikiPageUsesTemplate
- Template:Authority control
- Template:More citations needed
- Template:Queueing theory
- Template:Reflist
- Template:Short description
