System and method for efficient queue management

A computer program product residing on a non-transitory computer readable medium having a plurality of instructions stored thereon which, when executed by a processor, cause the processor to perform operations 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.

A computing system comprising:

• a memory;
• and
• a processor configured to define 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, wherein the processor is further configured to dequeue 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 wherein the processor is further configured to enqueue an element to the head element, wherein enqueuing the element to the head element includes adding a new element to the queue.