Full runtime polyhedral optimizing loop transformations with the generation, instantiation, and scheduling of code-bones - Archive ouverte HAL Access content directly
Journal Articles Concurrency and Computation: Practice and Experience Year : 2017

Full runtime polyhedral optimizing loop transformations with the generation, instantiation, and scheduling of code-bones

(1, 2) , (1) , (2, 1) , (1) , (2, 1)
1
2

Abstract

In this paper, we present a new runtime code generation technique for speculative loop optimization and parallelization. The main benefit of this technique, compared to previous approaches, is to enable advanced optimizing loop transformations at runtime with an acceptable time overhead. The loop transformations that may be applied are those handled by the polyhedral model. The proposed code generation strategy is based on the generation of “code-bones” at compile-time, which are parametrized code snippets either dedicated to speculation management or to computations of the original target program. These code-bones are then instantiated and assembled at runtime to constitute the speculatively optimized code, as soon as an optimizing polyhedral transformation has been determined. Their granularity threshold is sufficient to apply any polyhedral transformation, while still enabling fast runtime code generation. This approach has been implemented in the speculative loop parallelizing framework APOLLO.
Not file

Dates and versions

hal-01581093 , version 1 (04-09-2017)

Identifiers

Cite

Juan Manuel Martinez Caamaño, Manuel Selva, Philippe Clauss, Artiom Baloian, Willy Wolff. Full runtime polyhedral optimizing loop transformations with the generation, instantiation, and scheduling of code-bones. Concurrency and Computation: Practice and Experience, 2017, 29 (15), ⟨10.1002/cpe.4192⟩. ⟨hal-01581093⟩
174 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More