Parallel dynamic storage allocation algorithms

Authors:
Iyengar
Affiliations:
Hewlett-Packard Co., Chelmsford, MA, USA
Venue:
SPDP '93 Proceedings of the 1993 5th IEEE Symposium on Parallel and Distributed Processing
Year:
1993

Citing 0
Cited 2

Scalable SIMD-parallel memory allocation for many-core machines

The Journal of Supercomputing
Power-aware dynamic memory management on many-core platforms utilizing DVFS

ACM Transactions on Embedded Computing Systems (TECS) - Special Section on ESTIMedia'10

Quantified Score

Hi-index	0.00

Visualization

Abstract

A dynamic storage allocator manages space for objects whose lifetimes are not known by the system at the time for their creation. This paper examines parallel dynamic storage allocation algorithms. Three new algorithms, multiple free list fit I, modified quick fit, and multiple free list fit II, are presented which outperform all previous algorithms we tested. The performances of the three algorithms differ when the percentage of requests for large blocks is high. Multiple free list fit I is the fastest algorithm when large blocks of many different sizes are requested. Multiple free list fit II is the fastest algorithm when large blocks of only a few different sizes are requested.