Automatic restructuring of linked data structures

Authors:
Harmen L. A. van der Spek;C. W. Mattias Holm;Harry A. G. Wijshoff
Affiliations:
LIACS, Leiden University, Leiden, CA, The Netherlands;LIACS, Leiden University, Leiden, CA, The Netherlands;LIACS, Leiden University, Leiden, CA, The Netherlands
Venue:
LCPC'09 Proceedings of the 22nd international conference on Languages and Compilers for Parallel Computing
Year:
2009

Citing 12
Cited 2

Run-Time Parallelization and Scheduling of Loops

IEEE Transactions on Computers
Identifying DEF/USE Information of Statements that Construct and Traverse Dynamic Recursive Data Structures

LCPC '97 Proceedings of the 10th International Workshop on Languages and Compilers for Parallel Computing
Virtual Cache Line: A New Technique to Improve Cache Exploitation for Recursive Data Structures

CC '99 Proceedings of the 8th International Conference on Compiler Construction, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Automatic pool allocation for disjoint data structures

Proceedings of the 2002 workshop on Memory system performance
LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation

Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization
Hybrid analysis: static & dynamic memory reference analysis

International Journal of Parallel Programming
Automatic pool allocation: improving performance by controlling data structure layout in the heap

Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
Transparent pointer compression for linked data structures

Proceedings of the 2005 workshop on Memory system performance
Macroscopic data structure analysis and optimization

Macroscopic data structure analysis and optimization
An adaptive packed-memory array

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
MPADS: memory-pooling-assisted data splitting

Proceedings of the 7th international symposium on Memory management
Characterizing the performance penalties induced by irregular code using pointer structures and indirection arrays on the intel core 2 architecture

Proceedings of the 6th ACM conference on Computing frontiers

How to unleash array optimizations on code using recursive data structures

Proceedings of the 24th ACM International Conference on Supercomputing
Sublimation: expanding data structures to enable data instance specific optimizations

LCPC'10 Proceedings of the 23rd international conference on Languages and compilers for parallel computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The memory subsystem is one of the major performance bottlenecks in modern computer systems. While much effort is spent on the optimization of codes which access data regularly, not all codes will do so. Programs using pointer linked data structures are notorious for producing such so called irregular memory access patterns. In this paper, we present a compilation and run-time framework that enables fully automatic restructuring of pointer-linked data structures for type-unsafe languages, such as C. The restructuring framework is based on run-time restructuring using run-time trace information. The compiler transformation chain first identifies disjoint data structures that are stored in type-homogeneous memory pools. Access to these pools is traced and from these run-time traces, a permutation vector is derived. The memory pool is restructured at run-time using this permutation, after which all pointers (both stack and heap) that refer to the restructured pool must be updated. While the run-time tracing incurs a considerable overhead, we show that restructuring pointer-linked data structures can yield substantial speedups and that in general, the incurred overhead is compensated for by the performance improvements.