This library provides implementations of concurrent FIFO queues (for both general boxed and primitive unboxed values) that are fast, perform well under contention, and offer a Chan-like interface. The library may be of limited usefulness outside of x86 architectures where the fetch-and-add instruction is not available.

Here is an example benchmark measuring the time taken to write and then read 100,000 messages, with work divided amongst increasing number of readers and writers (time in ms), comparing against the top-performing queues in the standard libraries.

And here is a view on just the unagi implementations.