#io #lock-free #non-blocking

bondi

Single producer, multi consumer lock-free ring buffer (experimental)

3 releases

0.1.2 Jan 11, 2021
0.1.1 Jan 9, 2021
0.1.0 Jan 9, 2021

#215 in Concurrency

MIT license

13KB
252 lines

Bondi - lock-free single producer multi producer ring buffer

Bondi is yet another attempt of producing a lock-free, bounded, single-producer, multi-consumer data structure.

Note: this is an experimental project. Expect things to break, and change.

Usage

    // initialize a writer and two readers
    // send 100 `Message`s, and receive them from different threads
    struct Message(usize)

    fn main() {
        let bondi = Bondi::new(100);
        let writer = bondi.get_tx().unwrap();
        let reader = bondi.get_rx().unwrap();
        let reader2 = bondi.get_rx().unwrap();

        std::thread::spawn(move || {
            for i in 0..100 {
                writer.write(Message(i));
            }
        });

        std::thread::spawn(move || {
            let _ = reader.read();
        });

        std::thread::spawn(move || {
            let _ = reader2.read();
        }).join().unwrap();
    }

Inspiration sources

Disruptor

Bus

Turbine

Dependencies

~0.4–0.9MB
~21K SLoC