DOE OSTI · 2221951
Circular queue management with split indexes
Abstract
Methods and apparatus for managing circular queues are disclosed. A pointer designates an index position of a particular queue element and contains an additional pointer state, whereby two pointer values (split indexes) can designate the same index position. Front and rear pointers are respectively managed by dequeue and enqueue logic. The front pointer state and rear pointer state distinguish full and empty queue states when both pointers designate the same index position. Asynchronous dequeue and enqueue operations are supported, no lock is required, and no queue entry is wasted. Hardware and software embodiments for numerous applications are disclosed.
Keep this discovery
Explore connections, maps & timelines
Miniskar, Narasinga Rao, Liu, Frank Y., Vetter, Jeffrey S.. 2023-07-04. Circular queue management with split indexes. https://www.osti.gov/biblio/2221951
Cite the original work for its findings. Save a collection to share your selection of sources.