Dynamic FIFO queue

Posted by sam on Stack Overflow See other posts from Stack Overflow or by sam
Published on 2010-04-28T17:19:51Z Indexed on 2010/04/28 17:23 UTC
Read the original article Hit count: 373

Filed under:

Create a 4K buffer for storing 4 independent FIFO (first-in/first-out) queues of single byte character data. The organization of the FIFO should be as efficient as possible for storing the 4 queues to support dynamic (not fixed) queue size, insuring that no queue will overflow any other queue and given that it is unknown which queues may have the least # of elements and which queues may have the most # of elements.

© Stack Overflow or respective owner

Related posts about fifo