CPC G06F 5/06 (2013.01) [G06F 9/3855 (2013.01); G06F 9/4881 (2013.01); G06F 16/9024 (2019.01); G06F 2205/064 (2013.01)] | 21 Claims |
1. A computer-implemented method, executed on a computing device, comprising:
defining a queue, wherein the queue is based on a linked list and is a first-in, first-out (FIFO) queue that is configured to be used with multiple producers and a single consumer, wherein the queue includes a plurality of elements with a tail element and a head element defined wherein the tail element is a last element of the plurality of elements of the queue and the head element is a first element of the plurality of elements of the queue;
dequeuing an element from the tail element, wherein dequeuing the element from the tail element includes:
setting, via a consumer, a last element mark, and
determining if the tail element is in a null state; and
enqueuing an element to the head element, wherein enqueuing the element to the head element includes adding a new element to the queue.
|