@inproceedings{chilimbi2000designing,
author = {Chilimbi, Trishul and Jones, Richard and Zorn, Ben},
title = {Designing a Trace Format for Heap Allocation Events},
booktitle = {ISMM2000 International Symposium on Memory Management},
year = {2000},
month = {October},
abstract = {Dynamic storage allocation continues to play an important role in the performance and correctness of systems ranging from user productivity software to high-performance servers. While algorithms for dynamic storage allocation have been studied for decades, much of the literature is based on measuring the performance of benchmark programs unrepresentative of many important allocation-intensive workloads. Furthermore, to date no standard has emerged or been proposed for publishing and exchanging representative allocation workloads. In this paper, we describe a preliminary design of a trace format for such workloads and investigate its effectiveness at representing large allocation traces. Our proposal allows for a flexible encoding of information in the trace to achieve greater compression. We evaluate our preliminary design in two dimensions. First, we measure how effective these encodings are at reducing trace size. Second we consider how a meta-level specification language could be used to describe such formats and to generate trace readers and writers automatically.},
publisher = {ACM},
url = {http://approjects.co.za/?big=en-us/research/publication/designing-trace-format-heap-allocation-events/},
pages = {182-196},
edition = {ISMM2000 International Symposium on Memory Management},
}