Difference between revisions of "First-In First-Out buffer"
From Computer History Wiki
m (Jnc moved page FIFO to First-In First-Out buffer: Use full name for actual article) |
m (+links) |
||
| Line 1: | Line 1: | ||
| − | 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. | + | 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 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. |
| − | {{stub}} | + | {{semi-stub}} |
Revision as of 12:40, 1 October 2018
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.
