A collection of lock-free data structures written in standard C++11

1. lockfree

   1 11 861 4.8 C++

   A collection of lock-free data structures written in standard C++11

   

   - A lot of code won't work for types with no default constructors, but that is at least compile error

   - Using memcpy[0] for arbitrary types is just wrong, see [1]

   [0] https://github.com/DNedic/lockfree/blob/main/lockfree/inc/bi...

   [1] https://www.open-std.org/jtc1/sc22/wg21/docs/papers/2023/p11...

2. CodeRabbit

   coderabbit.ai featured

   CodeRabbit: AI Code Reviews for Developers. Revolutionize your code reviews with AI. CodeRabbit offers PR summaries, code walkthroughs, 1-click suggestions, and AST-based analysis. Boost productivity and code quality across all major languages with each PR.

   

3. spsc_queue

   2 2 38 6.7 C++

   A fast, concurrent, bounded, single producer, single consumer queue

   

   Should be benchmarked against ->

   https://github.com/Deaod/spsc_queue

   If proven faster OK.. If not.. Well.. back to the drawing board.

4. tlaplus

   3 40 2,390 9.5 Java

   TLC is a model checker for specifications written in TLA+. The TLA+Toolbox is an IDE for TLA+.

   

   Checking the invariant with assert is also useful in my limited experience with concurrency.

   https://lamport.azurewebsites.net/tla/tla.html

5. multiversion-concurrency-control

   4 19 66 7.3 Java

   Discontinued Implementation of multiversion concurrency control, Raft, Left Right concurrency Hashmaps and a multi consumer multi producer Ringbuffer, concurrent and parallel load-balanced loops, parallel actors implementation in Main.java, Actor2.java and a parallel interpreter

   I think I lean towards per-thread sharding instead of mutex based or lock free data structures except for lockfree ringbuffers.

   You can get embarassingly parallel performance if you split your data by thread and aggregate periodically.

   If you need a consistent view of your entire set of data, that is slow path with sharding.

   In my experiments with multithreaded software I simulate a bank where many bankaccounts are randomly withdrawn from and deposited to. https://github.com/samsquire/multiversion-concurrency-contro...

   I get 700 million requests per second due to the sharding of money over accounts.

6. multiversion-concurrency-contro

   5 16 - -

   I think I lean towards per-thread sharding instead of mutex based or lock free data structures except for lockfree ringbuffers.

   You can get embarassingly parallel performance if you split your data by thread and aggregate periodically.

   If you need a consistent view of your entire set of data, that is slow path with sharding.

   In my experiments with multithreaded software I simulate a bank where many bankaccounts are randomly withdrawn from and deposited to. https://github.com/samsquire/multiversion-concurrency-contro...

   I get 700 million requests per second due to the sharding of money over accounts.

7. glibc

   6 27 1,228 0.0 C

   Discontinued GNU Libc (by lattera)

   The code isn't the easiest to read but in glibc it seems that the syscall is only performed if waiter are detected in userspace during an unlock operation

   https://github.com/lattera/glibc/blob/master/nptl/pthread_mu...

Suggest a related project