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…
☆69Dec 29, 2020Updated 5 years ago
Alternatives and similar repositories for low-latency-primitive-concurrent-queues
Users that are interested in low-latency-primitive-concurrent-queues are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- hp low latency reliable multicast messaging☆126Nov 6, 2015Updated 10 years ago
- ☆85Jan 29, 2026Updated last month
- JEP with off heap support to replace portions of Unsafe and other sun.* methods.☆42Mar 12, 2014Updated 12 years ago
- A java.util.HashMap compatible map that won't stall puts or gets when resizing☆153Oct 6, 2022Updated 3 years ago
- Huge Collections for Java using efficient off heap storage☆273Dec 10, 2014Updated 11 years ago
- ☆11Dec 19, 2021Updated 4 years ago
- Falcon, the open source ultra low-latency FIX engine for Java