Transparent restructuring of pointer-linked data structures
Abstract
In contemporary computer systems, data layout has great influence on performance. Traditionally, automatic restructuring in type-unsafe languages has been hard, especially in the presence of pointers. In this thesis, the foundations are laid for successful restructuring of pointer linked data structures in type-unsafe languages such as C.
CompilersData restructuringHigh performance computingPointer analysis

