Dynamic storage allocation: A survey and critical review

  • Paul R. Wilson
  • Mark S. Johnstone
  • Michael Neely
  • David Boles
Invited Paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 986)

Abstract

Dynamic memory allocation has been a fundamental part of most computer systems since roughly 1960, and memory allocation is widely considered to be either a solved problem or an insoluble one. In this survey, we describe a variety of memory allocator designs and point out issues relevant to their design and evaluation. We then chronologically survey most of the literature on allocators between 1961 and 1995. (Scores of papers are discussed, in varying detail, and over 150 references are given.)

We argue that allocator designs have been unduly restricted by an emphasis on mechanism, rather than policy, while the latter is more important; higher-level strategic issues are still more important, but have not been given much attention.

Most theoretical analyses and empirical allocator evaluations to date have relied on very strong assumptions of randomness and independence, but real program behavior exhibits important regularities that must be exploited if allocators are to perform well in practice.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Paul R. Wilson
    • 1
  • Mark S. Johnstone
    • 1
  • Michael Neely
    • 1
  • David Boles
    • 1
  1. 1.Department of Computer SciencesUniversity of Texas at AustinAustinUSA
  2. 2.Convex Computer CorporationDallasUSA

Personalised recommendations