atilt / low-latency-pritimive-blocking-queues Goto Github PK
View Code? Open in Web Editor NEWThis project forked from robaustin/low-latency-primitive-concurrent-queues
Low latency, lock free, primitive bounded blocking queues backed by an primitive arrays such as an int[]. These classes mimic the interface of BlockingQueue, they work with primitive rather than Objects so are unable to actually implement the BlockingQueue. They take advantage of the Unsafe.putOrdered<X>, which allows the creation of non-blocking c
Home Page: www.boundedbuffer.co.uk
License: Apache License 2.0