Serialization of Queue Access without Locks
Original Publication Date: 1992-Apr-01
Included in the Prior Art Database: 2005-Mar-22
The scenario is as follows: o queues are singly linked. The last entry in the queue is "NULL" terminated. o entries are always added to the tail of a queue. o entries are always removed from the head of the queue. o there is a SINGLE "writer" for all the queues. o there is only ONE "reader" for a specific queue. o the "readers" have lower priority than the "writer" o the "writer" can NEVER be blocked by a "reader".