First-In First-Out buffer: Difference between revisions
From Computer History Wiki
Jump to navigationJump to search
m +cat |
ForOldHack (talk | contribs) |
||
| Line 2: | Line 2: | ||
FIFO buffers are found in both [[hardware]] and [[software]]; in the latter, they are usually implemented as [[ring buffer]]s, to avoid the un-productive overhead of shifting data around as data is added and removed. | FIFO buffers are found in both [[hardware]] and [[software]]; in the latter, they are usually implemented as [[ring buffer]]s, to avoid the un-productive overhead of shifting data around as data is added and removed. | ||
FIFO buffers are used in serial communications, where a UART needs to receive more data without interrupting the CPU. | |||
https://www.tldp.org/HOWTO/Serial-HOWTO-18.html#ss18.3 [[User:ForOldHack|ForOldHack]] ([[User talk:ForOldHack|talk]]) 10:26, 1 April 2019 (CEST) | |||
{{semi-stub}} | {{semi-stub}} | ||
[[Category:Hardware Basics]] | [[Category:Hardware Basics]] | ||
Revision as of 08:26, 1 April 2019
A First-In First-Out buffer (usually given as FIFO) is a form of buffer in which data is inserted at one end, and removed from the other, so that the data is retrieved in the same order as it went in - hence the name.
FIFO buffers are found in both hardware and software; in the latter, they are usually implemented as ring buffers, to avoid the un-productive overhead of shifting data around as data is added and removed.
FIFO buffers are used in serial communications, where a UART needs to receive more data without interrupting the CPU.
https://www.tldp.org/HOWTO/Serial-HOWTO-18.html#ss18.3 ForOldHack (talk) 10:26, 1 April 2019 (CEST)
