Space efficient parallel buddy memory management

Shared memory multiprocessor systems need efficient dynamic storage allocators, both for system purposes and to support parallel programs. Memory managers are often based on the buddy system, which provides fast allocation and release. Previous parallel buddy memory managers made no attempt to coordinate the allocation, splitting and release of blocks, and as a result needlessly fragment memory. The authors present fast, and simple parallel buddy memory manager that is also as space efficient as a serial buddy memory manager. They test their algorithms using memory allocation/deallocation traces their collected from a parallel sparse matrix algorithm.<
>