Ring-Buffer
A simple ring buffer (circular buffer) designed for embedded systems. (by AndersKaloer)
lockfree
A collection of lock-free data structures written in standard C++11 (by DNedic)
| Ring-Buffer | lockfree | |
|---|---|---|
| 1 | 11 | |
| 476 | 700 | |
| - | - | |
| 5.6 | 7.9 | |
| 5 months ago | about 1 month ago | |
| C | C++ | |
| MIT License | MIT License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Ring-Buffer
Posts with mentions or reviews of Ring-Buffer.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-11-08.
-
Library for generic ringbuffer that can be filled via DMA?
I haven't found any that satisfies my requirements. The ones I found (e.g. this one) requires me to write my own code to update internal state if I use e.g. a DMA transfer from UART to fill it.
lockfree
Posts with mentions or reviews of lockfree.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2024-02-29.
- A lock-free ring-buffer with contiguous reservations (2019)
-
Atomics and Concurrency
If you're interested about lock-free data structures, I wrote [lockfree](https://github.com/DNedic/lockfree) a collection of lock-free data structures meant to be readable and both hosted system and embedded friendly.
-
Optimizing a Ring Buffer for Throughput
If you want more than a spsc queue, I've written `lockfree`, a collection of SPSC and MPMC data structures along the same principles the author here used:https://github.com/DNedic/lockfree.
The library is written in standard C++11 (but additional API's for higher C++ versions have been added), uses no dynamic allocation and is configurable so it is both big metal and deeply embedded friendly.
-
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...
-
Lock-free data structures
My friend wrote a few lock-free data structures and he is now looking for some feedback. Here is the link: https://github.com/DNedic/lockfree
- A collection of lock-free data structures written in standard c++11
- A collection of embedded friendly lock-free data structures written in standard C++11
What are some alternatives?
When comparing Ring-Buffer and lockfree you can also consider the following projects:
lfbb - A Lock Free Bipartite Buffer Library written in standard C11
rc_event_queue - VecDeque-like fast, unbounded, mpmc/spmc concurent FIFO message queue. Lockless reads, write-lock writes.