Index vector elimination: making index vectors affordable

  • Authors:
  • Robert Bernecky;Stephan Herhut;Sven-Bodo Scholz;Kai Trojahner;Clemens Grelck;Alex Shafarenko

  • Affiliations:
  • University of Toronto, Canada;University of Hertfordshire, UK;University of Hertfordshire, UK;University of Lübeck, Germany;University of Hertfordshire, UK;University of Hertfordshire, UK

  • Venue:
  • IFL'06 Proceedings of the 18th international conference on Implementation and application of functional languages
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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 n-dimensional 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.