Search Results for "shared memory allocator"

With this library we provide useful data structures and algorithms for common programming tasks in the C language.

Minicoro is a single-file library for using asymmetric coroutines in C. The API is inspired by Lua coroutines but with C's use in mind. The project is being developed mainly to be a coroutine backend for the Nelua programming language. The library assembly implementation is inspired by Lua Coco by Mike Pall.

...The benchmark part shows that a context switch between coroutines only takes about 10 ns (in the case of the standalone stack) on the AWS c5d.large machine. User could choose to create a new coroutine with a standalone stack or with a shared stack (could be shared with others). It is extremely memory-efficient, 10,000,000 coroutines simultaneously to run cost only 2.8 GB physical memory (run with tcmalloc, each coroutine has a 120B copy-stack size configuration). The phrase "fastest" in above means the fastest context switching implementation which complies to the Sys V ABI of Intel386 or AMD64.

Primitive shared memory allocator that allows several independent processes to share same shared memory segments. It provides shared memory analogs to regular memry library calls like malloc(), free(), etc. Currently may work with mmap() or shmget().

ipc-quartztime is an inter process communication library based on shared memory, mutexes and signals. ipc-quartztime is intended for high-speed and high-throughput communication between processes.

A lock-free, concurrent, multi-reader, multi-writer and real-time capable ring-buffer implementation The ringbuffer uses int type values. For transmission of larger (than long int) buffers, an additional shared memory-pool is required.