![]() Queueing theory encompasses these methods for processing data structures, as well as interactions between strict-FIFO queues.Ĭomputer science Representation of a FIFO queue with enqueue and dequeue operations.ĭepending on the application, a FIFO could be implemented as a hardware shift register, or using different memory structures, typically a circular buffer or a kind of list. A priority queue is neither FIFO or LIFO but may adopt similar behaviour temporarily or by default. FIFO's opposite is LIFO, last-in-first-out, where the youngest entry or "top of the stack" is processed first. in the same sequence in which they arrive at the queue's tail.įCFS 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. Such processing is analogous to servicing people in a queue area on a first-come, first-served (FCFS) basis, i.e. In computing and in systems theory, first in, first out (the first in is the first out), acronymized as FIFO, is 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. JSTOR ( March 2015) ( Learn how and when to remove this template message).Unsourced material may be challenged and removed.įind sources: "FIFO" computing and electronics – news Please help improve this article by adding citations to reliable sources. This article needs additional citations for verification.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |