Memory system performance of programs with intensive heap allocation

  • Authors:

  • Amer Diwan;David Tarditi;Eliot Moss

  • Affiliations:

  • Department of Computer Science, University of Massachusetts, Amherst, MA;Computer Science Department, Carnegie Mellon Umversity, 5000 Forbes Avenue, Pittsburgh, PA;Department of Computer Science, University of Massachusetts, Amherst, MA

  • Venue:
  • ACM Transactions on Computer Systems (TOCS)
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

Heap allocation with copying garbage collection is a general storage management technique for programming languages. It is believed to have poor memory system performance. To investigate this, we conducted an in-depth study of the memory system performance of heap allocation for memory systems found on many machines. We studied the performance of mostly functional Standard ML programs which made heavy use of heap allocation. We found that most machines support heap allocation poorly. However, with the appropriate memory system organization, heap allocation can have good performance. The memory system property crucial for achieving good performance was the ability to allocate and initialize a new object into the cache without a penalty. This can be achieved by having subblock by placement with a subblock size of one word with a write-allocate policy, along with fast page-mode writes or a write buffer. For caches with subblock placement, the data cache overhead was under 9% for a 64K or larger data cache; without subblock placement the overhead was often higher than 50%.