Space efficient parallel buddy memory management (1992) [7 citations — 0 self]
by Theodore Johnson, Tim Davis
ftp://ftp.cis.ufl.edu/pub/tech-reports/tr92/tr92-008.ps.Z
Add To MetaCart
Abstract:
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.
Citations
| 432 | Direct Methods for Sparse Matrices – DUFF, ERISMAN, et al. - 1986 |
| 266 | Sparse Matrix Test Problems – Duff, Grimes, et al. - 1989 |
| 29 | A nondeterministic parallel algorithm for general unsymmetric sparse LU factorization – Davis, Yew - 1990 |
| 14 | Parallel dynamic storage allocation – Bigler, Allan, et al. - 1985 |
| 13 | Multiprocessing a sparse matrix code on the Alliant FX/8 – Duff - 1989 |
| 12 | Parallelizing the usual buddy algorithm – Gottlieb, Wilson - 1982 |
| 11 | Using the buddy system for concurrent memory allocation – Gottlieb, Wilson - 1981 |
| 2 | Concurrent Dynamic Storage Allocation – Ellis, Olson - 1987 |
| 2 | Concurrent algorithms for real time memory management – Ford - 1988 |
| 1 | Raytheon Submarine Signals Division – Roeber - 1991 |
