A practical automatic polyhedral parallelizer and locality optimizer

Bondhugula, Uday; Hartono, Albert; Ramanujam, J.; Sadayappan, P.

doi:10.1145/1375581.1375595

Cited by 584 publications

(400 citation statements)

References 63 publications

Supporting

Mentioning

392

Contrasting

Unclassified

Order By: Relevance

“…The optimizing compiler PLUTO (Bondhugula et al, 2008b), implementing affine transformations, does not generate any tiled code for this loop nest. Below, we demonstrate how tiled code can be generated for the two inner loops i and k by means of Algorithm 1.…”

Section: Applying the Approach To Real-life Codementioning

confidence: 99%

Tiling arbitrarily nested loops by means of the transitive

Bielecki

Palkowski

2016

International Journal of Applied Mathematics and Computer Science

View full text Add to dashboard Cite

A novel approach to generation of tiled code for arbitrarily nested loops is presented. It is derived via a combination of the polyhedral and iteration space slicing frameworks. Instead of program transformations represented by a set of affine functions, one for each statement, it uses the transitive closure of a loop nest dependence graph to carry out corrections of original rectangular tiles so that all dependences of the original loop nest are preserved under the lexicographic order of target tiles. Parallel tiled code can be generated on the basis of valid serial tiled code by means of applying affine transformations or transitive closure using on input an inter-tile dependence graph whose vertices are represented by target tiles while edges connect dependent target tiles. We demonstrate how a relation describing such a graph can be formed. The main merit of the presented approach in comparison with the well-known ones is that it does not require full permutability of loops to generate both serial and parallel tiled codes; this increases the scope of loop nests to be tiled.

show abstract

Section: Applying the Approach To Real-life Codementioning

confidence: 99%

Tiling arbitrarily nested loops by means of the transitive

Bielecki

Palkowski

2016

International Journal of Applied Mathematics and Computer Science

View full text Add to dashboard Cite

show abstract

“…For this class of program, it is possible to restructure the code automatically [6,15] to expose rectangular tiles of parametric size. Assuming that a system such as PrimeTile [15] has already been used to generate parametric rectangularly tiled code, we focus on the problem of tile size optimization for such codes.…”

Section: Model Of Computationmentioning

confidence: 99%

Analytical Bounds for Optimal Tile Size Selection

Shirako

Sharma

Fauzia

et al. 2012

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper, we introduce a novel approach to guide tile size selection by employing analytical models to limit empirical search within a subspace of the full search space. Two analytical models are used together: 1) an existing conservative model, based on the data footprint of a tile, which ignores intra-tile cache block replacement, and 2) an aggressive new model that assumes optimal cache block replacement within a tile. Experimental results on multiple platforms demonstrate the practical effectiveness of the approach by reducing the search space for the optimal tile size by 1,307× to 11,879× for an Intel Core-2-Quad system; 358× to 1,978× for an Intel Nehalem system; and 45× to 1,142× for an IBM Power7 system. The execution of rectangularly tiled code tuned by a search of the subspace identified by our model achieves speed-ups of up to 1.40× (Intel Core-2 Quad), 1.28× (Nehalem) and 1.19× (Power 7) relative to the best possible square tile sizes on these different processor architectures. We also demonstrate the integration of the analytical bounds with existing search optimization algorithms. Our approach not only reduces the total search time from Nelder-Mead Simplex and Parallel Rank Ordering methods by factors of up to 4.95× and 4.33×, respectively, but also finds better tile sizes that yield higher performance in tuned tiled code.

show abstract

“…The polyhedral model [1,3,23], of which the Omega Test is part, has drawn a lot of attention in recent years, and newer optimization and parallelization tools, such as Pluto [6], have emerged that take advantage of it. However, unlike the work currently done within the polyhedral model, we do not use the dependence abstractions to drive code transformations, but rather export them in symbolic notation to enable our run-time to make scheduling and message exchange decisions.…”

Section: Related Workmentioning

confidence: 99%

From Serial Loops to Parallel Execution on Distributed Systems

Bosilca

Bouteiller

Danalis

et al. 2012

Euro-Par 2012 Parallel Processing

View full text Add to dashboard Cite

Abstract. Programmability and performance portability are two major challenges in today's dynamic environment. Algorithm designers targeting efficient algorithms should focus on designing high-level algorithms exhibiting maximum parallelism, while relying on compilers and runtime systems to discover and exploit this parallelism, delivering sustainable performance on a variety of hardware. The compiler tool presented in this paper can analyze the data flow of serial codes with imperfectly nested, affine loop-nests and if statements, commonly found in scientific applications. This tool operates as the front-end compiler for the DAGuE run-time system by automatically converting serial codes into the symbolic representation of their data flow. We show how the compiler analyzes the data flow, and demonstrate that scientifically important, dense linear algebra operations can benefit from this analysis, and deliver high performance on large scale platforms.

show abstract

A practical automatic polyhedral parallelizer and locality optimizer

Cited by 584 publications

References 63 publications

Tiling arbitrarily nested loops by means of the transitive

Tiling arbitrarily nested loops by means of the transitive

Analytical Bounds for Optimal Tile Size Selection

From Serial Loops to Parallel Execution on Distributed Systems

Contact Info

Product

Resources

About