Index vector elimination - Making index vectors affordable

Robert Bernecky, Stephan Herhut, Sven Bodo Scholz, Kai Trojahner, Clemens Grelck, Alex Shafarenko

Abstract

Compiling indexing operations on n-dimensional arrays into efficiently executable code is a challenging task. This paper focuses on the reduction of offset computations as they typically occur when transforming index vectors into offsets for linearized representations of ndimensional arrays. We present a high-level optimization to that effect which is generally applicable, even in the presence of statically unknown rank (n). Our experiments show run-time improvements between a factor of 2 and 16 on a set of real-world benchmarks.

Original languageEnglish
Pages19-36
Number of pages18
Publication statusPublished - 01.12.2007
Event18th International Symposium on Implementation and Application of Functional Languages - Budapest, Hungary
Duration: 04.09.200606.09.2006
Conference number: 71089

Conference

Conference18th International Symposium on Implementation and Application of Functional Languages
Abbreviated titleIFL 2006
Country/TerritoryHungary
CityBudapest
Period04.09.0606.09.06

Fingerprint

Dive into the research topics of 'Index vector elimination - Making index vectors affordable'. Together they form a unique fingerprint.

Cite this