Memory-System Performance of Programs with Intensive Heap Allocation (1995)
by
Amer Diwan
,
David Tarditi
,
Eliot Moss
| Venue: | Transactions on Computer Systems |
| Citations: | 13 - 1 self |
BibTeX
@ARTICLE{Diwan95memory-systemperformance,
author = {Amer Diwan and David Tarditi and Eliot Moss},
title = {Memory-System Performance of Programs with Intensive Heap Allocation},
journal = {Transactions on Computer Systems},
year = {1995},
volume = {13},
pages = {244--273}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper appeared in the 21st Annual Symposium on Principles of Programming Languages.
Citations
| 595 | Compiling with Continuations - Appel - 1992 |
| 255 | Optimally Profiling and Tracing Programs - Ball, Larus - 1994 |
| 215 | A nonrecursive list compacting algorithm - Cheney - 1970 |
| 196 | B.: The concurrency workbench: a semanticsbased tool for the verification of concurrent systems - Cleaveland, Parrow, et al. - 1993 |
| 170 | Simple generational garbage collection and fast allocation. Software Practice and Experience - Appel - 1989 |
| 149 | The impact of operating system structure on memory system performance - Chen, Bershad - 1993 |
| 107 | Continuation-passing, closure-passing style - Appel, Jim - 1989 |
| 103 | Garbage collection can be faster than stack allocation - Appel - 1987 |
| 76 | Yochelson: A LISP garbage-collector for virtual-memory computer systems - Fenichel, J - 1969 |
| 62 | A Runtime System - Appel - 1990 |
| 47 | The SIMPLE code - Crowley, Hendrickson, et al. - 1978 |
| 23 | A lexical analyzer generator for Standard ML. Distributed with Standard ML of New - Appel, Mattson, et al. - 1989 |
