31 Jul
2011
31 Jul
'11
1:30 p.m.
I have not compared the 'folkloric' queue yet.
I meant ring buffer. Can't find it in Herlihy. Got a reference?
it is called WaitFreeQueue (section 3). however the implementation looks quite different from the book: WaitFreeQueue simply increments read/write indices and uses the integer modulo to wrap the indices into the queue range. if the size is not a power of two, the implementation cannot use bitmasks for that, and would be prone to integer overflows ... however the ideas are the same ... cheers, tim