Abstract: A method and system for providing a lock-free self-service queue. The method includes enqueuing at least one node in the queue; competing, by producer threads, to append their respective nodes to a last node of the queue; allowing only one producer thread to append its respective node to the last node of the queue, in which unsuccessful producer threads either give up or reattempt to append their nodes to the appended node; and allowing at least one of the producer threads to temporarily operate as a consumer thread to process the first non-deleted node, and then logically delete at least one non-mark-deleted node among the nodes, in which the at least one consumer thread and others of the producer threads are concurrently executed; and modifying the next node pointer field of the last node of the enqueued at least one node to include an address of the appended node.

Abstract: A method and system for providing a lock-free self-service queue. The method includes enqueuing at least one node in the queue; competing, by producer threads, to append their respective nodes to a last node of the queue; allowing only one producer thread to append its respective node to the last node of the queue, in which unsuccessful producer threads either gives up or reattempt to append their nodes to the appended node; and allowing at least one of the plurality of producer threads to temporarily operate as a consumer thread to process the first non-deleted node, and then logically delete at least one non-mark-deleted node among the plurality of nodes, in which the consumer thread and the plurality of producer threads are concurrently executed; and modifying the next node pointer field of the last node of the enqueued at least one node to include an address of the appended node.