Non-blocking concurrent queues with direct node access by threads

   
   

Multiple non-blocking FIFO queues are concurrently maintained using atomic compare-and-swap (CAS) operations. In accordance with the invention, each queue provides direct access to the nodes stored therein to an application or thread, so that each thread may enqueue and dequeue nodes that it may choose. The prior art merely provided access to the values stored in the node. In order to avoid anomalies, the queue is never allowed to become empty by requiring the presence of at least a dummy node in the queue. The ABA problem is solved by requiring that the next pointer of the tail node in each queue point to a "magic number" unique to the particular queue, such as the pointer to the queue head or the address of the queue head, for example. This obviates any need to maintain a separate count for each node.

 
Web www.patentalert.com

< System and process for broadcast and communication with very low bit-rate bi-level or sketch video

< System and method for converting and reconverting between file system requests and access requests of a remote transfer protocol

> Test execution framework for automated software testing

> Method and apparatus for computer input using six degrees of freedom

~ 00178