Abstract: "There are many algorithms for the space-time mapping of nested loops. Some of them even make the optimal choices within their framework. We propose a preprocessing phase for algorithms in the polytope model, which extends the model and yields space-time mappings whose schedule is, in...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Griebl, Martin (VerfasserIn), Feautrier, Paul (VerfasserIn), Lengauer, Christian (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Passau 1999
Schriftenreihe:	Universität <Passau> / Fakultät für Mathematik und Informatik: MIP 1999,08
Schlagworte:	Loops (Group theory) Parallel processing (Electronic computers)
Zusammenfassung:	Abstract: "There are many algorithms for the space-time mapping of nested loops. Some of them even make the optimal choices within their framework. We propose a preprocessing phase for algorithms in the polytope model, which extends the model and yields space-time mappings whose schedule is, in some cases, orders of magnitude faster. These are cases in which the dependence graph has small irregularities. The basic idea is to split the iteration domain of the loop nests into parts with a regular dependence structure and apply the existing space-time mapping algorithms to these parts individually. This work is based on a seminal idea in the more limited context of loop parallelization at the code level. We elevate the idea to the model level (our model is the polytope model), which increases its applicability by providing a clearer and wider range of choices at an acceptable analysis cost. Index set splitting is one facet in the effort to extend the power of the polytope model and to enable the generation of competitive target code."
Beschreibung:	22, 4 S. graph. Darst.