Composing High-Performance Memory Allocators with Heap Layers

Composing High-Performance Memory Allocators Emery Berger , Ben Zorn, Kathryn McKinley

Motivation & Contributions ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Outline ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Using Custom Allocators ,[object Object],[object Object],[object Object],[object Object],[object Object]

Custom Allocators Work ,[object Object]

Problems with Current Practice ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Allocator Conceptual Design ,[object Object],Select heap based on size malloc free Manage small objects System memory manager Manage large objects

Infrastructure Requirements ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Possible Solutions  virtual method overhead function call overhead Fast   function-pointer assignment High-level   Mixins (our approach) rigid hierarchy  Object-oriented (CMM [Attardi et al. 1998])   Indirect function calls (Vmalloc [Vo 1996]) Reusable Flexible

Ordinary Classes vs. Mixins ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

A Heap Layer void * malloc (sz) { do something; void * p = SuperHeap::malloc (sz); do something else; return p; } heap layer ,[object Object],[object Object],[object Object],[object Object]

Example: Thread-safety ,[object Object],[object Object],void * malloc (sz) { acquire lock; void * p = release lock; return p; } class LockedMallocHeap: public LockedHeap<mallocHeap> {}; SuperHeap::malloc (sz); LockedHeap mallocHeap

Example: Debugging ,[object Object],[object Object],DebugHeap class LockedDebugMallocHeap: public LockedHeap< DebugHeap<mallocHeap> > {}; LockedHeap void free (p) { check that p is valid; check that p hasn’t been freed before; } SuperHeap::free (p); mallocHeap

Implementation in Heap Layers ,[object Object],SegHeap malloc free SizeHeap FreelistHeap manage objects on freelist add size info to objects select heap based on size

Experimental Methodology ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Experimental Results: Custom Allocation – gcc

Experimental Results: General-Purpose Allocators

Conclusion ,[object Object],[object Object],[object Object],[object Object],[object Object]

A Library of Heap Layers ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Heap Layers as Experimental Infrastructure ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Composing High-Performance Memory Allocators with Heap Layers

Recommended

Recommended

More Related Content

What's hot

What's hot (20)

Similar to Composing High-Performance Memory Allocators with Heap Layers

Similar to Composing High-Performance Memory Allocators with Heap Layers (20)

More from Emery Berger

More from Emery Berger (20)

Recently uploaded

Recently uploaded (20)

Composing High-Performance Memory Allocators with Heap Layers