Best effort FIFO MPMC queue

[qwwdfsad]

From Cliff Click JavaOne talk (see slides 51-53)

As far as I know there is no such queue implementations (neither in high scale lib nor anywhere else), so JCTools seems like a perfect place for it.

[nitsanw]

Interesting idea, a PR would be a great step towards evaluating the benefit. I've not seen hard numbers/implementations to support the idea.

[ekuvardin]

From Cliff Click JavaOne talk (see slides 51-53)

So I found this idea very interesting. But does anyone have this presenation and what is the main idea? Even https://web.archive.org/ couldn't find it. I waste a lot of time and couldn't find any pdf. To save this issue for future explorers and don't close it due to lose pdf I leave this piece of code below(author read the original paper and wrote some pseudocode)
http://dev.cheremin.info/2011/08/highly-scalable-java-3.html (for those who can read russian)

while( !CAS( items[producerLocalIndex], null, newItem ) ){
  producerLocalIndex = ( producerLocalIndex + 1 ) % items.length; 
}

do{
  consumerLocalIndex = ( consumerLocalIndex + 1 ) % items.length;
  item = items[consumerLocalIndex];
} while( !CAS( items[consumerLocalIndex], item, null ) );
return item;

But I think it more likely first in random out then FIFO according to code.