Implementing heap-object behavior prediction efficiently and effectively

Software - Practice and Experience

Volumn 31, Issue 9, 2001, Pages 869-892

  Seidl, Matthew L ^a,b   Zorn, Benjamin G ^a  

^a UCB 450   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Dynamic storage allocation; Memory management; Profile based optimization; Program customization; Reference locality

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); OBJECT ORIENTED PROGRAMMING; OPTIMIZATION; VIRTUAL STORAGE;

DYNAMIC STORAGE ALLOCATION;

STORAGE ALLOCATION (COMPUTER);

EID: 0035948681     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/spe.375     Document Type: Article

References (20)

1. Quantifying behavioral differences between C and C++ programs
2. Segregating heap objects by reference behavior and locality
3. Cache-conscious structure layout
4. ATOM: A system for building customized program analysis tools
5. Efficient path profiling
6. Cache-conscious data placement
7. A general and efficient memory allocator
8. A performance study of rime warp
9. Memory allocation costs in large C and C++ programs
10. Remembrance of things past: Locality and memory in BDDs
11. Fundamental algorithms
12. Fast fits: New methods for dynamic storage allocation
13. Improving the cache locality of memory allocation
14. Using generational garbage collection to implement cache-conscious data placement
15. Improving cache behavior of dynamically allocated data structures
16. Cache-conscious structure definition
17. Using lifetime predictors to improve memory allocation performance
18. Predicting lifetimes in dynamically allocated memory