heapsgroups
Heapsgroups are a conceptual design for memory management in which the heap space is partitioned into multiple isolated groups, or heapsgroups, each containing its own heap data structures and metadata. The goal is to improve scalability and locality in multi-core or multi-processor systems by reducing contention on a single global heap and by keeping allocations close to the code that uses them.
Each heapsgroup maintains a local free list, an allocation policy, and potentially structures such as per-group
Allocation requests are satisfied from the local group's free lists; if insufficient, the allocator may obtain
Advantages include reduced contention, improved cache locality, and more predictable allocation times in concurrent workloads. Challenges
In practice, heapsgroups appear in research discussions of scalable allocators, specialized runtimes, and experimental memory systems.