Space–time mapping and tiling: a helpful combination: Research Articles

Authors:
Martin Griebl;Peter Faber;Christian Lengauer
Affiliations:
Department of Mathematics and Informatics, University of Passau, D-94030 Passau, Germany;Department of Mathematics and Informatics, University of Passau, D-94030 Passau, Germany;Department of Mathematics and Informatics, University of Passau, D-94030 Passau, Germany
Venue:
Concurrency and Computation: Practice & Experience - Compilers for Parallel Computers
Year:
2004

Citing 0
Cited 3

Iterative Optimization in the Polyhedral Model: Part I, One-Dimensional Time

Proceedings of the International Symposium on Code Generation and Optimization
Loop parallelization in multi-dimensional cartesian space

PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Combined Iterative and Model-driven Optimization in an Automatic Parallelization Framework

Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tiling is a well-known technique for sequential compiler optimization, as well as for automatic program parallelization. However, in the context of parallelization, tiling should not be considered as a stand-alone technique, but should be applied after a dedicated parallelization phase, in our case after space–time mapping. We show how tiling can benefit from space–time mapping, and we derive an algorithm for computing tiles which can minimize the number of communication startups, taking the number of physically available processors into account. We also present how the use of a simple cost model reduces real execution time. Copyright © 2004 John Wiley & Sons, Ltd.