bagpipe 0.1.0

A concurrent bag datastructure.
Documentation
  • Coverage
  • 61.54%
    24 out of 39 items documented0 out of 30 items with examples
  • Size
  • Source code size: 85.89 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 5.24 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 12s Average build duration of successful builds.
  • all releases: 12s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • Repository
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • joshlf

Bagpipe

A Bagpipe is an implementation of a concurrent pool data-structure. It is built on top of an implementation of a concurrent queue or stack data-structure. It shards requests for pushing and popping objects among a small set of queues or stacks, with load balancing performed in a manner that is low in coordination among threads. Contention is automatically managed by unrolling tight loops within the underlying queues and allowing threads to attempt pushing on another queue if a CAS failure occurs.

Other Features

This repo also includes implementations of concurrent queues such as the FAAArrayQueue and the YangCrummeyQueue. These are linearizable non-blocking multi-producer multi-consumer queues that may be of independent interest, as they scale better than the queues present in the crossbeam library (to my knowledge).