The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Automatic pool allocation: improving performance by controlling data structure layout in the heap
Abstract
This paper describes Automatic Pool Allocation , a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows heuristics to be used to partially control the internal layout of those data structures. The primary goal of this work is performance improvement, not automatic memory management, and the paper makes several new contributions. The key contribution is a new compiler algorithm for partitioning heap objects in imperative programs based on a context-sensitive pointer analysis, including a novel strategy for correct handling of indirect (and potentially unsafe) function calls. The transformation does not require type safe programs and works for the full generality of C and C++. Second, the paper describes several optimizations that exploit data structure partitioning to further improve program performance. Third, the paper evaluates how memory hierarchy behavior and overall program performance are impacted by the new transformations. Using a number of benchmarks and a few applications, we find that compilation times are extremely low, and overall running times for heap intensive programs speed up by 10-25% in many cases, about 2x in two cases, and more than 10x in two small benchmarks. Overall, we believe this work provides a new framework for optimizing pointer intensive programs by segregating and controlling the layout of heap-based data structures.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
Cited by
Szekeres, L., Payer, M., Wei, T., & Song, D. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.13 · Cited by 664
Kuznetsov, V., Szekeres, L., Payer, M., Candea, G., Sekar, R., & Song, D. X. (2014) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.5555/2685048.2685061 · Cited by 311
Metadata
- Authors
- Lattner, C., & Adve, V.
- Venue
- ACM SIGPLAN Notices
- Published
- 2005-06-12
- Volume
- 40
- Issue
- 6
- Pages
- 129-142
- ISSN
- 0362-1340 (ISSN-L)
- 1558-1160
- OpenAlex
- W2147278401
- Cited by
- 158
- References
- 1
- FWCI
- 18.44
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Automatic pool allocation: improving performance by controlling data structure layout in the heap. https://app.cochat.ai/papers/10.1145/1064978.1065027
- The paper
- Lattner, C., & Adve, V. (2005). Automatic pool allocation: improving performance by controlling data structure layout in the heap. ACM SIGPLAN Notices. https://doi.org/10.1145/1064978.1065027
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.