lockfree
Ring-Buffer
Our great sponsors
lockfree | Ring-Buffer | |
---|---|---|
11 | 1 | |
695 | 475 | |
- | - | |
7.9 | 5.6 | |
20 days ago | 5 months ago | |
C++ | C | |
MIT License | MIT License |
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.
lockfree
- 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
Ring-Buffer
-
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.
What are some alternatives?
rc_event_queue - VecDeque-like fast, unbounded, mpmc/spmc concurent FIFO message queue. Lockless reads, write-lock writes.
lfbb - A Lock Free Bipartite Buffer Library written in standard C11
distortos - object-oriented C++ RTOS for microcontrollers
lwrb - Lightweight generic ring buffer manager library
glibc - GNU Libc
buffet - All-inclusive Buffer for C
micro-gl - Headers Only C++11 CPU Vector Graphics. no std-lib, no FPU and no GPU required !
stm32h7-dual-core-inter-cpu-async-communication - Inter-CPU asynchronous communication between Cortex-M7 and Cortex-M4 cores on STM32H7 dual core devices
tlaplus - TLC is a model checker for specifications written in TLA+. The TLA+Toolbox is an IDE for TLA+.
set-ethernet-max-ring-buffer - Set max TX/RX ring buffer for ethernet device
EmbeddedRingBuffer - A ring buffer designed to work with embedded devices, does not use heap allocations.