Functions Palette/Programming/Synchronization/Queue Operations: Difference between revisions
New page: ==Location in palette== ==Concept== A queue maintains a first in/first out order of data items. For instance, the customers waiting in line at a fast food restaurant are in a queue. A queu... |
No edit summary |
||
| Line 3: | Line 3: | ||
A queue maintains a first in/first out order of data items. For instance, the customers waiting in line at a fast food restaurant are in a queue. A queue is useful in producer/consumer situations, where one portion of code is creating data to be used by another portion. The advantage of using a queue is that the producer and consumer rates do not have to be identical. If consumption is slower than production, the queue will become full and the producer code will be forced to wait until the consumer has dequeued an element before a new element can be queued up. | A queue maintains a first in/first out order of data items. For instance, the customers waiting in line at a fast food restaurant are in a queue. A queue is useful in producer/consumer situations, where one portion of code is creating data to be used by another portion. The advantage of using a queue is that the producer and consumer rates do not have to be identical. If consumption is slower than production, the queue will become full and the producer code will be forced to wait until the consumer has dequeued an element before a new element can be queued up. | ||
==Example use cases== | ==Example use cases== | ||
[[category:synchronization]] | |||
Revision as of 09:47, 1 October 2007
Location in palette
Concept
A queue maintains a first in/first out order of data items. For instance, the customers waiting in line at a fast food restaurant are in a queue. A queue is useful in producer/consumer situations, where one portion of code is creating data to be used by another portion. The advantage of using a queue is that the producer and consumer rates do not have to be identical. If consumption is slower than production, the queue will become full and the producer code will be forced to wait until the consumer has dequeued an element before a new element can be queued up.