Lag, Drag, Void and Use - Heap Profiling and Space-Efficient Compilation Revisited (1996)
| Venue: | In Proc. Intl. Conf. on Functional Programming |
| Citations: | 16 - 3 self |
BibTeX
@INPROCEEDINGS{Röjemo96lag,drag,,
author = {Niklas Röjemo and Colin Runciman},
title = {Lag, Drag, Void and Use - Heap Profiling and Space-Efficient Compilation Revisited},
booktitle = {In Proc. Intl. Conf. on Functional Programming},
year = {1996},
pages = {34--41},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The context for this paper is functional computation by graph reduction. Our overall aim is more efficient use of memory. The specific topic is the detection of dormant cells in the live graph --- those retained in heap memory though not actually playing a useful role in computation. We describe a profiler that can identify heap consumption by such `useless' cells. Unlike heap profilers based on traversals of the live heap, this profiler works by examining cells postmortem. The new profiler has revealed a surprisingly large proportion of `useless' cells, even in some programs that previously seemed space-efficient such as the boot-strapping Haskell compiler nhc. 1 Introduction A typical computation by graph reduction involves a large and changing population of heap-memory cells. Taking a census of this population at regular intervals can be very instructive, both for functional programmers and for functional-language implementors. A heap profiler [RW93] records population counts for ...
