Recursive data structure profiling

Proceedings of the 3rd 2005 ACM SIGPLAN Workshop on Memory Systems Performance, MSP 2005

Volumn , Issue , 2005, Pages 5-14

  Raman, Easwaran ^a   August, David I ^a  

^a Princeton University   (United States)

Author keywords

Dynamic shape graph; List linearization; Memory profiling; RDS; Shape profiling

Indexed keywords

DATA STRUCTURES; MEMORY ARCHITECTURE; TREES (MATHEMATICS);

HIGH-LEVEL PROGRAM; MEMORY ACCESS LATENCY; PROCESSOR-MEMORY PERFORMANCE GAP; RECURSIVE DATA STRUCTURES; RUNTIME BEHAVIORS; SHAPE GRAPH; SHAPE PROFILING; STRUCTURE OPTIMIZATION;

STRUCTURAL OPTIMIZATION;

EID: 84958619613     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1111583.1111585     Document Type: Conference Paper

References (16)

1. CALDER, B., KRINTZ, C., JOHN, S., AND AUSTIN, T. Cache-conscious data placement. In Proceedings of the 8th International Symposium on Architectural Support for Programming Languages and Operating Systems ASPLOS'98 (October 1998)
2. CLARK, D. W. List structure: measurements, algorithms, and encodings. PhD thesis, Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, 1976
3. CORMEN, T. H., LEISERSON, C. E., AND RIVEST, R. L. Introduction to Algorithms. The MIT Press and McGraw-Hill, 1992
4. GHIYA, R., AND HENDREN, L. J. Is it a tree, dag, or cyclic graph? In Proceedings of the ACM Symposium on Principles of Programming Languages (January 1996)
5. HACKETT, B., AND RUGINA, R. Region-based shape analysis with tracked locations. In Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (2005), pp. 310-323
6. KAPLAN, H., SHAFRIR, N., AND TARJAN, R. E. Union-find with deletions. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2002), pp. 19-28
7. LATTNER, C., AND ADVE, V. Automatic pool allocation for disjoint data structures. In Proceedings of the Workshop on Memory System Performance (2002), ACM Press, pp. 13-24
8. LATTNER, C., AND ADVE, V. Data structure analysis: A fast and scalable context-sensitive heap analysis. Tech. Rep. UIUCDCS-R-2003-2340, University of Illinois, Urbana, Illinois, April 2003
9. LUK, C.-K., COHN, R., MUTH, R., PATIL, H., KLAUSER, A., LOWNEY, G., WALLACE, S., REDDI, V. J., AND HAZELWOOD, K. Pin: Building customized program analysis tools with dynamic instrumentation. In Proceedings of the ACM SIGPLAN 2005 Conference on Programming Language Design and Implementation (June 2005)
10. LUK, C.-K., AND MOWRY, T. C. Memory forwarding: Enabling aggressive layout optimizations by guaranteeing the safety of data relocation. In Proceedings of the 26th International Symposium on Computer Architecture (July 1999)
11. NYSTROM, E. M., JU, R. D., AND HWU, W. W. Characterization of repeating data access patterns in integer benchmarks. In Proceedings of the 28th International Symposium on Computer Architecture (September 2001)
12. PEARCE, D. J., AND KELLY, P. H. J. Online algorithms for topological order and strongly connected components. Tech. rep., Imperial College, September 2003
13. RUGINA, R. Quantitative shape analysis. In Proceedings of the 11th Static Analysis Symposium (2004)
14. SAGIV, M., REPS, T., AND R.WILHELM. Solving shape-analysis problems in languages with destructive updating. In Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) (January 1996), pp. 16-31
15. VACHHARAJANI, M., VACHHARAJANI, N., PENRY, D. A., BLOME, J. A., AND AUGUST, D. I. Microarchitectural exploration with Liberty. In Proceedings of the 35th International Symposium on Microarchitecture (MICRO) (November 2002), pp. 271-282
16. WU, Q., PYATAKOV, A., SPIRIDONOV, A. N., RAMAN, E., CLARK, D. W., AND AUGUST, D. I. Exposing memory access regularities using object-relative memory profiling. In Proceedings of the International Symposium on Code Generation and Optimization (2004), IEEE Computer Society.