Concerns: Internal and External Fragmentation; speed

Data Structures: Linked List(s), binary search trees, buddy system

Slab allocation:

Separate group for each type of object.

When objects are freed, they are just marked simply as free and any one can be reused without reinitializing and with minimal searching. So allocation is fast.

Possible benefits for cache performance