一个基于C++11的轻量级网络框架，基于线程池技术可以实现大并发网络IO

A thread-safe queue faster and more resource efficient than golang's native channels

A simple ring buffer (circular buffer) designed for embedded systems.

simple C++11 ring buffer implementation, allocated and evaluated at compile time

A fast, generic fifo for MCUs.

Single producer and multi-reader lockless ring buffer in go using generics from the go 1.18.x release. It is significantly faster than channels with the added type safety of generics compared to ring buffers using interfaces.

A fixed-size circular buffer written in Rust.

轻量级网络库, 基于C++11

Inter-CPU asynchronous communication between Cortex-M7 and Cortex-M4 cores on STM32H7 dual core devices

Lock-free MPMC Ring Buffer (Generic) for SMP, in golang. Some posts in chinese:

Ring-buffer implementation that thinly wraps a numpy array

traffic-shm (Anna) is a Java based lock free IPC library.

CherryRingBuffer is an efficient and easy-to-use ringbuffer, especially for dma support.

A ring buffer designed to work with embedded devices, does not use heap allocations.

A lightweight C++ STL style circular buffer.

RingBuffer (FIFO) for C (e.g. for STM32)

High-performance in-memory ring buffer

The generic ring buffer with auto-scaler (elastic buffer).

A lock-free ring buffer for Python and Cython

Lock free data structures and patterns in Golang

Lock-free ring buffer in Go, support SPSC/SPMC/MPSC/MPMC implementations.

Handle more than 200,000 write-requests per second with Lmax disruptor, Kafka and gRPC

My ring/FIFO buffer implementation, for embedde applications. Tested on STM32L1, STM32F3, STM32F4 and PIC18F platforms.

An optimized Ring Buffer implementation based on the POSIX shared memory trick

This repository contains a circular buffer or a ring buffer implementation in C code suitable for embedded systems.

C/C++Non-Blocking Lock-Free/Wait-Free Circular-Queue

A lightweight C library of portability wrappers and data structures

A high-performance network packet capture library

A collection of lockless, concurrent queues

In-memory pub/sub designed for single producer fan-out to many consumers. Maximum write throughput, small memory footprint and best-effort delivery.