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-blockin…
67Updated 3 years ago

Related projects

Alternatives and complementary repositories for low-latency-primitive-concurrent-queues