Custom memory allocators in C++ to improve the performance of dynamic memory allocation

Rapid YAML - a library to parse and emit YAML, and do it fast.

C++ Custom memory allocators

Speed up the memory allocation and improve the garbage collection performance.

A set of custom memory allocators

This is the custom implementation of function malloc for embedded systems, that defragmentate memory after using it. Good solution when you need to allocate memory dynamically, but memory fragmentation is the problem.

An experimental game-engine

Customisable, thread-safe C11 memory allocator based off the K&R "storage allocator"

🎓 Implementation different basic allocators for manual memory management in C language. You can use it like a library for your goals.

This library implements a std::vector like Dynamic Array data structure in C, allowing for the creation, modification, and manipulation of an array whose size can be dynamically adjusted during runtime.

This is the magic implementation of dynamic string. Based on dalloc allocator, that solves memory fragmentation problem. So you can use it in your embedded project and not to be afraid of program crash by reason of memory fragmentation.

Object-oriented programming

This is the magic implementation of dynamic array. Based on dalloc allocator, that solves memory fragmentation problem. So you can use it in your embedded project and not to be afraid of program crash by reason of memory fragmentation.

Programming, IS ITMO, 1st and 2nd semester (C, C++)

An ultra simple single-threaded linear allocator

Collection of specialized memory allocators

A custom allocator that allows a singular allocation of a specific size known ahead of time.

Production-focused C allocator toolkit with aligned allocation pool allocators diagnostics and benchmark-driven memory experiments.

ArenaBinAllocator is a custom memory allocator written in C that simulates low-level memory management using a preallocated arena. It supports malloc, free, and realloc operations with a binning strategy for efficient small allocations and implements block merging to minimize fragmentation and optimize memory reuse.