circular buffer

(redirected from Circular queue)

circular buffer

(programming)
An area of memory used to store a continuous stream of data by starting again at the beginning of the buffer after reaching the end. A circular buffer is usually written by one process and read by another. Separate read and write pointers are maintained. These are not allowed to pass each other otherwise either unread data would be overwritten or invalid data would be read.

A circuit may implement a hardware circular buffer.

circular buffer

An area of memory or a dedicated hardware circuit that is used to store incoming data. When the buffer is filled, new data are written starting at the beginning of the buffer. Circular buffers are typically used to hold data written by one process and read by another. In such cases, separate read and write pointers are used that are not allowed to cross each other so that unread data cannot be overwritten by new data.
References in periodicals archive ?
reduce the need for stacking, where aircraft join a circular queue to land at busy airports, helping to reduce carbon emissions and noise impact
The ready queue is treated as a circular queue. The CPU scheduler goes around the ready queue, allocating the CPU to each process for a time interval of up to 1 time quantum [1,5].
In this strategy, the single circular queue is substituted with the dual circular queues with different priorities.
The video of crowds moving in one circular queue is shown in Fig.
PD starts the execution adding a token with the associated package name in a circular queue. The monitoring of job advancements is achieved by PD querying the MIDS.
CSJ (Check Status of Jobs): this thread monitors the token status inserted in the circular queue. When a package terminates the execution normally, the CSJ notifies such condition to the WFS module.
Events: [MATHEMATICAL enabled: a > 0 EXPRESSION NOT action: [p'.sub.1] = [p.sub.1] + 1 REPRODUCIBLE [conjunction] a' = a - 1 IN ASCII] [MATHEMATICAL enabled: a > 0 EXPRESSION NOT action: [p'.sub.2] = [p.sub.2] + 1 REPRODUCIBLE [conjunction] a' = a - 1 IN ASCII] [MATHEMATICAL enabled: a < s EXPRESSION NOT action: [c'.sub.1] = [c.sub.1] + 1 REPRODUCIBLE [conjunction] a' = a + 1 IN ASCII] [MATHEMATICAL enabled: a < s EXPRESSION NOT action: [c'.sub.2] = [c.sub.2] + 1 REPRODUCIBLE [conjunction] a' = a + 1 IN ASCII] 8.4 Circular Queue Program
The circular queue program (Figure 13) consists of one producer component and one consumer component.
There are several interesting properties we may want to prove about the circular queue program:
When we decompose the events of the circular queue program using the DNF event decomposition, we get a program with 6 events as shown in Figure 15.
Contract notice: The provision of passenger services in the circular queue.
modernisation will reduce circular queues in the sky above airports that are busy.