Subj : Re: Tsigas & Zhang non-blocking concurrent shared-memory FIFO.
To   : comp.programming.threads
From : Chris Thomasson
Date : Fri Sep 09 2005 06:58 pm

> In my implementation, I fixed it by using some spare bits in the
> pointer which store a copy of a per-node counter that is incremented
> each time a node is enqueued. I have 2^^31 different null values, and
> 65536 different pointers to the same queue node.
>
> I have lots of bits since the node pointers are really indices into an
> array of node structures.

Like this?

http://groups.google.com/group/comp.programming.threads/msg/c0eb5f08e858948f?hl=en

.