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

[ bsd3, concurrency, library ] [ Propose Tags ]

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.

Versions [faq] 0.1.0.0, 0.1.0.1, 0.1.0.2, 0.1.1.0, 0.2.0.0, 0.2.0.1, 0.3.0.0, 0.3.0.1, 0.3.0.2, 0.4.0.0, 0.4.1.0, 0.4.1.1, 0.4.1.2, 0.4.1.3
Dependencies atomic-primops (==0.6.0.5), base (<5), primitive (>=0.5.3), stm, unagi-chan [details]
License BSD-3-Clause
Author Brandon Simmons
Maintainer brandon.m.simmons@gmail.com
Category Concurrency
Source repo head: git clone https://github.com/jberryman/unagi-chan.git -b master
Uploaded by BrandonSimmons at 2014-07-10T04:08:48Z
Distributions Arch:0.4.1.3, NixOS:0.4.1.3
Executables dev-example
Downloads 12617 total (158 in the last 30 days)
Rating 2.5 (votes: 4) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Successful builds reported [all 1 reports]

Modules

[Index]

Flags

NameDescriptionDefaultType
devDisabledManual
compare-benchmarksDisabledManual

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

Downloads

Maintainer's Corner

For package maintainers and hackage trustees