Parallel dynamic storage allocation algorithms

Author

Iyengar, Arun

Author_Institution

Hewlett-Packard Co., Chelmsford, MA, USA

fYear

1993

fDate

1-4 Dec 1993

Firstpage

82

Lastpage

91

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

Keywords

parallel algorithms; storage allocation; dynamic storage allocator; modified quick fit; multiple free list fit I; multiple free list fit II; parallel dynamic storage allocation algorithms; Aging; Computer languages; Concurrency control; Heuristic algorithms; Memory management; Parallel machines; Performance evaluation; Programming profession; System performance; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on

Conference_Location

Dallas, TX

Print_ISBN

0-8186-4222-X

Type

conf

DOI

10.1109/SPDP.1993.395547

Filename

395547