unagi-chan: Fast and scalable concurrent queues for x86, with a Chan-like API

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 concurrently write and read 100,000 messages, with work divided amongst increasing number of readers and writers, comparing against the top-performing queues in the standard libraries, with an inset graph showing a zoomed-in view on the implementations here.

Modules

[Index]

Flags

Manual Flags

Name	Description	Default
compare-benchmarks		Disabled
dev		Disabled

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

• unagi-chan-0.2.0.1.tar.gz [browse] (Cabal source package)
• Package description (revised from the package)

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

Package maintainers

• BrandonSimmons

For package maintainers and hackage trustees

• edit package information

Candidates

• 0.4.1.1, 0.4.1.2, 0.4.1.3, 0.4.1.4