A very fast cross-platform memory pool mechanism for C++ built using a data-oriented approach (3 to 24 times faster than regular new or delete, depending on operating system & compiler)
-
Updated
Jul 18, 2024 - C++
A very fast cross-platform memory pool mechanism for C++ built using a data-oriented approach (3 to 24 times faster than regular new or delete, depending on operating system & compiler)
A WebServer write by C++
Dynamic memory pool implementation, for reusable fixed, or variable sized memory blocks, using pthread mutex locks.
A fast and efficient implementation of a MemoryPool<T>.
simple memory pool / thread safe / minimized context switching / Memory managed in 4 levels / Requirements(Windows xp~ / Visualstudio 2015)
ShinyAllocator is a library of a block memory allocator for real-time high-integrity embedded systems.
A port to D of my Free Pascal "Binary Trees" benchmark implementation, initially written as a self-learning exercise.
Lockless MemoryPool
A simple allocator based on memory pool to speed up the dynamic allocation of a large number of small blocks and to reduce memory fragmentation.
This is a C++ port of my D port of my Free Pascal "Binary Trees" benchmark implementation, written out of curiosity to see how they compare.