A Compile/Run-time Environment for the Automatic Transformation of Linked List Data Structures.

Saved in:

Bibliographic Details
Title:	A Compile/Run-time Environment for the Automatic Transformation of Linked List Data Structures.
Authors:	Spek, H.¹ hvdspek@liacs.nl, Groot, S.¹, Bakker, E.¹, Wijshoff, H.¹
Source:	International Journal of Parallel Programming. Dec2008, Vol. 36 Issue 6, p592-623. 32p. 6 Diagrams, 4 Charts, 6 Graphs.
Subjects:	Compilers (Computer programs), Optimizing compilers, Data structures, Electronic data processing, Computer software, Programming software, Systems software, Data
Abstract:	Irregular access patterns are a major problem for today’s optimizing compilers. In this paper, a novel approach will be presented that enables transformations that were designed for regular loop structures to be applied to linked list data structures. This is achieved by linearizing access to a linked list, after which further data restructuring can be performed. Two subsequent optimization paths will be considered: annihilation and sublimation, which are driven by the occurring regular and irregular access patterns in the applications. These intermediate codes are amenable to traditional compiler optimizations targeting regular loops. In the case of sublimation, a run-time step is involved which takes the access pattern into account and thus generates a data instance specific optimized code. Both approaches are applied to a sparse matrix multiplication algorithm and an iterative solver: preconditioned conjugate gradient. The resulting transformed code is evaluated using the major compilers for the x86 platform, GCC and the Intel C compiler. [ABSTRACT FROM AUTHOR]
	Copyright of International Journal of Parallel Programming is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	Irregular access patterns are a major problem for today’s optimizing compilers. In this paper, a novel approach will be presented that enables transformations that were designed for regular loop structures to be applied to linked list data structures. This is achieved by linearizing access to a linked list, after which further data restructuring can be performed. Two subsequent optimization paths will be considered: annihilation and sublimation, which are driven by the occurring regular and irregular access patterns in the applications. These intermediate codes are amenable to traditional compiler optimizations targeting regular loops. In the case of sublimation, a run-time step is involved which takes the access pattern into account and thus generates a data instance specific optimized code. Both approaches are applied to a sparse matrix multiplication algorithm and an iterative solver: preconditioned conjugate gradient. The resulting transformed code is evaluated using the major compilers for the x86 platform, GCC and the Intel C compiler. [ABSTRACT FROM AUTHOR]
ISSN:	08857458
DOI:	10.1007/s10766-008-0085-2