Efficient, lock-free, bounded Rust broadcast channel
Rust
846
176 commits
updated Sep 9, 2023
Bus provides a lock-free, bounded, single-producer, multi-consumer, broadcast channel.
NOTE: bus sometimes busy-waits in the current implementation, which may cause increased CPU usage — see #23.
It uses a circular buffer and atomic instructions to implement a lock-free single-producer,
multi-consumer channel. The interface is similar to that of the std::sync::mpsc channels,
except that multiple consumers (readers of the channel) can be produced, whereas only a single
sender can exist. Furthermore, in contrast to most multi-consumer FIFO queues, bus is
broadcast; every send goes to every consumer.
I haven't seen this particular implementation in literature (some extra bookkeeping is necessary to allow multiple consumers), but a lot of related reading can be found in Ross Bencina's blog post "Some notes on lock-free and wait-free algorithms".
See the documentation for usage examples.
Licensed under either of
at your option.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.
Overall
Maintained
Code review
crates.io
Latest release
Releases this year
(top 24 of 29)
970 followers · starred Jul 2019
837 followers · starred Jul 2018
408 followers · starred Jan 2021
207 followers · starred Mar 2023
Efficient, lock-free, bounded Rust broadcast channel
Rust
846
176 commits
updated Sep 9, 2023
Bus provides a lock-free, bounded, single-producer, multi-consumer, broadcast channel.
NOTE: bus sometimes busy-waits in the current implementation, which may cause increased CPU usage — see #23.
It uses a circular buffer and atomic instructions to implement a lock-free single-producer,
multi-consumer channel. The interface is similar to that of the std::sync::mpsc channels,
except that multiple consumers (readers of the channel) can be produced, whereas only a single
sender can exist. Furthermore, in contrast to most multi-consumer FIFO queues, bus is
broadcast; every send goes to every consumer.
I haven't seen this particular implementation in literature (some extra bookkeeping is necessary to allow multiple consumers), but a lot of related reading can be found in Ross Bencina's blog post "Some notes on lock-free and wait-free algorithms".
See the documentation for usage examples.
Licensed under either of
at your option.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.
Overall
Maintained
Code review
crates.io
Latest release
Releases this year
(top 24 of 29)
970 followers · starred Jul 2019
837 followers · starred Jul 2018
408 followers · starred Jan 2021
207 followers · starred Mar 2023