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 language | English (US) |
---|---|
Pages | 293-305 |
Number of pages | 13 |
DOIs | |
State | Published - 1995 |
Event | Conference Record of Conference on Functional Programming Languages and Computer Architecture - La Jolla, CA, USA Duration: Jun 25 1995 → Jun 28 1995 |
Other
Other | Conference Record of Conference on Functional Programming Languages and Computer Architecture |
---|---|
City | La Jolla, CA, USA |
Period | 6/25/95 → 6/28/95 |
All Science Journal Classification (ASJC) codes
- General Engineering