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

Découvrez les meilleurs dépôts open-source grâce à notre recherche par IA.

ExplorerRecherches sélectionnéesAlternatives open sourceLogiciels auto-hébergésBlogPlan du site
ProjetServeur MCPÀ proposNotre méthodologiePresse
Mentions légalesConfidentialitéConditions d'utilisation
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

Memory pool

Classement mis à jour le 25 juil. 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

Trouvez les meilleurs dépôts grâce à l'IA.Nous recherchons les dépôts les plus pertinents grâce à l'IA.
  • mattconte/tlsfAvatar de mattconte

    mattconte/tlsf

    1,571Voir sur 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
    Voir sur GitHub↗1,571
  • rust-embedded/heaplessAvatar de rust-embedded

    rust-embedded/heapless

    1,977Voir sur 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
    Voir sur GitHub↗1,977
  • teslamotors/fixed-containersAvatar de teslamotors

    teslamotors/fixed-containers

    447Voir sur 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
    Voir sur GitHub↗447
  • foonathan/memoryAvatar de foonathan

    foonathan/memory

    1,610Voir sur 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
    Voir sur 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
  • un format de sérialisation binaire pour données structurées
  • banque de questions pour entretiens C++
  • un cache rapide en mémoire