Optimizing pointer linked data structures

Abstract

The thesis explores different ways of optimizing pointer linked data

structures, and especially restructuring them. The mechanisms are based

on compiler technology, theory, computer languages and hardware

architecture that are capable of optimizing the memory layout of complex pointer linked data structures.

Data restructuringPointer optimizationLinked data structuresCompilersComputer architectureLanguage extensions