Abstract: A circular queue system is implemented using either a ‘mirror space’ appended to the circular portion of the queue (or buffer) or an ‘borrow’ space appended to the circular portion of the queue (or buffer). In each implementation, address verification or checking within the queue is not implemented until such time as the read or write portion to the queue has substantially completed. Where the address would normally exceed the physical or logical end address of the circular queue, the ‘mirror space’ or ‘borrow’ space provides sufficient storage to prevent overflow into other valid data.