Full runtime polyhedral optimizing loop transformations with the generation, instantiation, and scheduling of code‐bones. (9th June 2017)

• Record Type: Journal Article
• Authors: Martinez Caamaño, Juan Manuel; Selva, Manuel; Clauss, Philippe; Baloian, Artyom; Wolff, Willy
• Other Names: Lengauer Christian guestEditor.; Bougé Luc guestEditor.; Trystram Denis guestEditor.; Balaji Pavan guestEditor.; Leung Kai‐Cheung guestEditor.
• Is Part Of: Concurrency and computation. Volume 29:Number 15(2017)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2017-06-09
• Subjects: automatic parallelization -- loop transformations -- polyhedral model -- runtime code generation -- speculative parallelization; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.4192
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: 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.