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. We a present fast, and simple parallel buddy memory manager that is also as space efficient
as a serial buddy memory manager. We test our algorithms using memory allocation/deallocation
traces collected from a parallel sparse matrix algorithm.