Cache performance of fast-allocating programs

1 January 1995

proceedings article
Published by Association for Computing Machinery (ACM)

p. 293-305
https://doi.org/10.1145/224164.224219

Abstract

We study the cache performance of a set of ML programs, com- piled by the Standard ML of New Jersey compiler. We find that more than half of the reads are for objects that have just been allo- cated. We also consider the effects of varying software (garbage collection frequency) and hardware (cache) parameters. Confirm- ing results of related experiments, we found that ML programs can have good cache performance when there is no penalty for allocation. Even on caches that have an allocation penalty, we found that ML programs can have lower miss ratios than the C and Fortran SPEC92 benchmarks. Topics: 4 benchmarks, performance analysis; 21 hardware design, measurements; 17 garbage collection, storage allo cation; 46 runtime systems.

Keywords

This publication has 0 references indexed in Scilit: