Improving the Performance of Buddy Systems
IEEE Transactions on Computers
An efficient algorithm for heap storage allocation
ACM SIGPLAN Notices
Algorithms for parallel memory allocation
International Journal of Parallel Programming
Dynamic storage allocation on a multiprocessor
Dynamic storage allocation on a multiprocessor
A dynamic storage allocation technique based on memory residence time
Communications of the ACM
A unifying look at data structures
Communications of the ACM
Communications of the ACM
Dynamic memory allocation in computer simulation
Communications of the ACM
Experience in automatic storage allocation
Communications of the ACM
Concurrent Algorithms for Real-Time Memory Management
IEEE Software
Overview of the Monsoon Project
ICCD '91 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Dynamic Storage Allocation: A Survey and Critical Review
IWMM '95 Proceedings of the International Workshop on Memory Management
New methods for dynamic storage allocation (Fast Fits)
SOSP '83 Proceedings of the ninth ACM symposium on Operating systems principles
Dynamic storage allocation techniques.
Dynamic storage allocation techniques.
Operating system data structures for shared memory mimd machines with fetch-and-add
Operating system data structures for shared memory mimd machines with fetch-and-add
Analysis of free-storage algorithms: revisited
IBM Systems Journal
Memory allocation for long-running server applications
Proceedings of the 1st international symposium on Memory management
Techniques for efficiently allocating persistent storage
Journal of Systems and Software
| Hi-index | 0.00 |
Dynamic storage allocation has a significant impact on computer performance. A dynamic storage allocator manages space for objects whose lifetimes are not known by the system at the time of their creation. A good dynamic storage allocator should utilize storage efficiently and satisfy requests in as few instructions as possible. A dynamic storage allocator on a multiprocessor should have the ability to satisfy multiple requests concurrently. This paper examines parallel dynamic storage allocation algorithms and how performance scales with increasing numbers of processors. The highest throughputs and lowest instruction counts are achieved with multiple free list fit I. The best memory utilization is achieved using a best fit system.