Cache performance of fast-allocating programs

Marcelo J.R. Goncalves, Andrew W. Appel

Research output: Contribution to conferencePaper

12 Scopus citations

Abstract

We study the cache performance of a set of ML programs, compiled by the Standard ML of New Jersey compiler. We find that more than half of the reads are for objects that have just been allocated. We also consider the effects of varying software (garbage collection frequency) and hardware (cache) parameters. Confirming 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.

Original languageEnglish (US)
Pages293-305
Number of pages13
DOIs
StatePublished - Jan 1 1995
EventConference Record of Conference on Functional Programming Languages and Computer Architecture - La Jolla, CA, USA
Duration: Jun 25 1995Jun 28 1995

Other

OtherConference Record of Conference on Functional Programming Languages and Computer Architecture
CityLa Jolla, CA, USA
Period6/25/956/28/95

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Cache performance of fast-allocating programs'. Together they form a unique fingerprint.

  • Cite this

    Goncalves, M. J. R., & Appel, A. W. (1995). Cache performance of fast-allocating programs. 293-305. Paper presented at Conference Record of Conference on Functional Programming Languages and Computer Architecture, La Jolla, CA, USA, . https://doi.org/10.1145/224164.224219