In search of a program generator to implement generic transformations for high-performance computing

  • Authors:

  • Albert Cohen;Sébastien Donadio;Maria-Jesus Garzaran;Christoph Herrmann;Oleg Kiselyov;David Padua

  • Affiliations:

  • ALCHEMY group, INRIA Futurs, Orsay, France;PRiSM, University of Versailles, France;DCS, University of Illinois at Urbana-Champaign, IL;FMI, University of Passau, Germany;FNMOC, Monterey, CA;DCS, University of Illinois at Urbana-Champaign, IL

  • Venue:
  • Science of Computer Programming - Special issue on the first MetaOCaml workshop 2004
  • Year:
  • 2006

Quantified Score

Hi-index 0.02

Visualization

Abstract

The quality of compiler-optimized code for high-performance applications is far behind what optimization and domain experts can achieve by hand. Although it may seem surprising at first glance, the performance gap has been widening over time, due to the tremendous complexity increase in microprocessor and memory architectures, and to the rising level of abstraction of popular programming languages and styles. This paper explores in-between solutions, neither fully automatic nor fully manual ways to adapt a computationally intensive application to the target architecture. By mimicking complex sequences of transformations useful to optimize real codes, we show that generative programming is a practical means to implement architecture-aware optimizations for high-performance applications.This work explores the promises of generative programming languages and techniques for the high-performance computing expert. We show that complex, architecture-specific optimizations can be implemented in a type-safe, purely generative framework. Peak performance is achievable through the careful combination of a high-level, multi-stage evaluation language - MetaOCaml - with low-level code generation techniques. Nevertheless, our results also show that generative approaches for high-performance computing do not come without technical caveats and implementation barriers concerning productivity and reuse. We describe these difficulties and identify ways to hide or overcome them, from abstract syntaxes to heterogeneous generators of code generators, combining high-level and type-safe multi-stage programming with a back-end generator of imperative code.