Results 1 - 10 of 101

Towards Unimodular Transformations for Non-perfectly Nested Loops

by Peter M. W. Knijnenburg , 1994
"... In this paper we discuss a possibility to extend unimodular transformations to non-perfectly nested loops. The main idea behind this extension is to convert a non-perfectly nested loop into a perfectly nested one by moving code into to innermost loop and properly guarding it to avoid multiple exe ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
In this paper we discuss a possibility to extend unimodular transformations to non-perfectly nested loops. The main idea behind this extension is to convert a non-perfectly nested loop into a perfectly nested one by moving code into to innermost loop and properly guarding it to avoid multiple

Parallelizing perfectly nested loops with non-uniform dependences

by Volodymyr Beletskyy, Maciej Poliwoda - IN: PROCEEDINGS OF THE 9-TH INTERNATIONAL CONFERENCE ACS'2002. (2002
"... A linear transformation technique permitting perfectly nested loops with non–uniform dependences to be parallelized is presented. The technique proposed does not require loop-carried dependences to be uniformized. Firstly, a matrix, describing hyperplanes, is formed for a loop, which can expose bo ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
A linear transformation technique permitting perfectly nested loops with non–uniform dependences to be parallelized is presented. The technique proposed does not require loop-carried dependences to be uniformized. Firstly, a matrix, describing hyperplanes, is formed for a loop, which can expose

Unimodular Transformations of Non-Perfectly Nested Loops

by Jingling Xue - Parallel Computing , 1997
"... A framework is described in which a class of imperfectly nested loops can be restructured using unimodular transformations. In this framework, an imperfect loop nest is converted to a perfect loop nest using Abu-Sufah's Non-Basic-to-Basic-Loop transformation. Conditions for the legality of this ..."
Abstract - Cited by 21 (4 self) - Add to MetaCart
A framework is described in which a class of imperfectly nested loops can be restructured using unimodular transformations. In this framework, an imperfect loop nest is converted to a perfect loop nest using Abu-Sufah's Non-Basic-to-Basic-Loop transformation. Conditions for the legality

Parallel Execution of Non-perfect nested Loops with Non-uniform Dependences

by Non-uniform Dependences, Jialin Ju, Jialin Ju, Vipin Chaudhary, Vipin Chaudhary
"... This paper addresses the issue of parallelizing non-perfect nested loops with nonuniform dependences. This kind of loop normally can't be parallelized by existing parallelizing compilers and transformations. Even when parallelized in rare instances, the performance is very poor. Our approach is ..."
Abstract - Add to MetaCart
This paper addresses the issue of parallelizing non-perfect nested loops with nonuniform dependences. This kind of loop normally can't be parallelized by existing parallelizing compilers and transformations. Even when parallelized in rare instances, the performance is very poor. Our approach

A Resource Constrained Loop Pipelining Technique For Perfectly- Nested Loop Structures (U)

by Thor Davis Aakre, Aakre Thor Davis
"... Pft~i mpo* %- for On--- of i~mnwon is-Nowoavm e ia ps. h mbu. •swq • *"&9 rv ..."
Abstract - Add to MetaCart
Pft~i mpo* %- for On--- of i~mnwon is-Nowoavm e ia ps. h mbu. •swq • *"&9 rv

Transformations for Imperfectly Nested Loops

by Induprakas Kodukula, Keshav Pingali - In Supercomputing , 1996
"... Loop transformations are critical for compiling high-performance code for modern computers. Existing work has focused on transformations for perfectly nested loops (that is, loops in which all assignment statements are contained within the innermost loop of a loop nest). In practice, most loop nests ..."
Abstract - Cited by 12 (1 self) - Add to MetaCart
Loop transformations are critical for compiling high-performance code for modern computers. Existing work has focused on transformations for perfectly nested loops (that is, loops in which all assignment statements are contained within the innermost loop of a loop nest). In practice, most loop

Simple Code Generation for special UDLs

by Florina Ciorba , Theodore Andronikos, Dimitris Kamenopoulos, Panagiotis Theodoropoulos, George Papakonstantinou - IN 1ST BALKAN CONFERENCE IN INFORMATICS (BCI’03) , 2003
"... This paper focuses on transforming sequential perfectly nested loops into their equivalent parallel form. A special category of FOR nested loops is the uniform dependence loops (UDLs), which yield efficient parallelization techniques. An automatic code ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
This paper focuses on transforming sequential perfectly nested loops into their equivalent parallel form. A special category of FOR nested loops is the uniform dependence loops (UDLs), which yield efficient parallelization techniques. An automatic code

The Bouclettes loop parallelizer

by Pierre Boulet , 1995
"... Bouclettes is a source to source loop nest parallelizer. It takes as input Fortran uniform, perfectly nested loops and gives as output an HPF (High Performance Fortran) program with data distribution and parallel ($HPF! INDEPENDENT) loops. This paper presents the tool and the underlying parallelizat ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Bouclettes is a source to source loop nest parallelizer. It takes as input Fortran uniform, perfectly nested loops and gives as output an HPF (High Performance Fortran) program with data distribution and parallel ($HPF! INDEPENDENT) loops. This paper presents the tool and the underlying

Synthesizing transformations for locality enhancement of imperfectly-nested loop nests

by Nawaaz Ahmed, Nikolay Mateev, Keshav Pingali - In Proceedings of the 2000 ACM International Conference on Supercomputing , 2000
"... We present an approach for synthesizing transformations to enhance locality in imperfectly-nested loops. The key idea is to embed the iteration space of every statement in a loop nest into a special iteration space called the product space. The product space can be viewed as a perfectly-nested loop ..."
Abstract - Cited by 64 (3 self) - Add to MetaCart
We present an approach for synthesizing transformations to enhance locality in imperfectly-nested loops. The key idea is to embed the iteration space of every statement in a loop nest into a special iteration space called the product space. The product space can be viewed as a perfectly-nested loop

Synthesizing Transformations for Locality Enhancement of Imperfectly-nested Loop Nests

by Nawaaz Ahmed Nikolay, Nikolay Mateev, Keshav Pingali - In Proceedings of the 2000 ACM International Conference on Supercomputing , 2000
"... We present an approach for synthesizing transformations to enhance locality in imperfectly-nested loops. The key idea is to embed the iteration space of every statement in a loop nest into a special iteration space called the product space. The product space can be viewed as a perfectly-nested loop ..."
Abstract - Add to MetaCart
We present an approach for synthesizing transformations to enhance locality in imperfectly-nested loops. The key idea is to embed the iteration space of every statement in a loop nest into a special iteration space called the product space. The product space can be viewed as a perfectly-nested loop
Results 1 - 10 of 101