awesome-repositories.com
Blog
MCP
awesome-repositories.com

Discover the best open-source repositories with AI-powered search.

ExploreCurated searchesOpen-source alternativesSelf-hosted softwareBlogSitemap
ProjectMCP serverAboutHow we rankPress
LegalPrivacyTerms
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

Memory pool

Ranking updated Jul 25, 2026

For fixed size memory buffers, the strongest matches are mattconte/tlsf (TLSF is a dynamic memory allocator designed for real-time), rust-embedded/heapless (This Rust library provides static, heapless data structures designed) and teslamotors/fixed-containers (This C++ library provides fixed-capacity data structures designed to). foonathan/memory is also worth a look. Each is ranked by relevance to your query, popularity and recent activity.

Explore top open-source fixed-size memory buffer libraries for C and C++. Compare performance, features, and active repositories to pick the best fit.

Memory pool

Find the best repos with AI.We'll search the best matching repositories with AI.
  • mattconte/tlsfmattconte avatar

    mattconte/tlsf

    1,571View on GitHub↗

    Two-Level Segregated Fit memory allocator implementation.

    TLSF is a dynamic memory allocator designed for real-time systems, which differs from fixed-size pools but still provides bounded response times suitable for high-performance use.

    CMemory Allocation
    View on GitHub↗1,571
  • rust-embedded/heaplessrust-embedded avatar

    rust-embedded/heapless

    1,977View on GitHub↗

    Heapless is an embedded Rust data structure library that provides statically allocated, fixed-capacity collections for memory-constrained systems. It implements a zero-allocation runtime model where all collection elements are stored inline within their own value structure, completely removing the need for operating system interaction, global allocators, or runtime heap allocation. Capacity is specified at compile time through generic type parameters, ensuring every collection has a fixed upper bound known before execution. The library implements core language traits to provide standard coll

    This Rust library provides static, heapless data structures designed for embedded systems and memory-constrained environments, aligning well with your search for pre-allocated, zero-allocation components even though it focuses on data structures rather than pure allocators.

    RustFixed-Capacity Containers
    View on GitHub↗1,977
  • teslamotors/fixed-containersteslamotors avatar

    teslamotors/fixed-containers

    447View on GitHub↗

    C++ Fixed Containers

    This C++ library provides fixed-capacity data structures designed to avoid dynamic memory allocation, fitting the systems programming use case though lacking explicit concurrency primitives.

    C++Data Structures
    View on GitHub↗447
  • foonathan/memoryfoonathan avatar

    foonathan/memory

    1,610View on GitHub↗

    STL compatible C++ memory allocator library using a new RawAllocator concept that is similar to an Allocator but easier to use and write.

    This repository provides a C++ memory allocator library that supports custom allocation strategies like pools and fixed-size blocks for systems programming, though it is a general-purpose allocator library rather than strictly a compile-time fixed-size buffer tool.

    C++Memory AllocationMemory Management
    View on GitHub↗1,610

Related searches

  • Memory management systems
  • Memory profilers
  • Immutable data structures
  • a memory persistence layer for AI agents
  • a memory profiler for debugging application leaks
  • a binary serialization format for structured data
  • a question bank for C++ interviews
  • a fast in-memory cache store