An efficient profile-analysis framework for data-layout optimizations
- 1 January 2002
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 37 (1), 140-153
- https://doi.org/10.1145/565816.503287
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Efficient representations and abstractions for quantifying and exploiting data reference localityPublished by Association for Computing Machinery (ACM) ,2001
- An automatic object inlining optimization and its evaluationPublished by Association for Computing Machinery (ACM) ,2000
- Automated data-member layout of heap objects to improve memory-hierarchy performanceACM Transactions on Programming Languages and Systems, 2000
- Segregating heap objects by reference behavior and lifetimePublished by Association for Computing Machinery (ACM) ,1998
- Using generational garbage collection to implement cache-conscious data placementPublished by Association for Computing Machinery (ACM) ,1998
- The influence of caches on the performance of heapsACM Journal of Experimental Algorithmics, 1996
- Using lifetime predictors to improve memory allocation performancePublished by Association for Computing Machinery (ACM) ,1993
- A data locality optimizing algorithmPublished by Association for Computing Machinery (ACM) ,1991
- Strategies for cache and local memory management by global program transformationJournal of Parallel and Distributed Computing, 1988
- Properties of the working-set modelCommunications of the ACM, 1972