Alain Darte and Guillaume Huard. Complexity of multi-dimensional loop alignment. In 19th International Symposium on Theoretical Aspects of Computer Science, Juan-les-Pins, France, March 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
New Complexity Results on Array Contraction and Related Problems - Darte, Huard (2002) Self-citation (Darte Huard) (Correct)
No context found.
Alain Darte and Guillaume Huard. Complexity of multi-dimensional loop alignment. In 19th International Symposium on Theoretical Aspects of Computer Science, Juan-les-Pins, France, March 2002.
New Results on Array Contraction - Darte, Huard (2002) (1 citation) Self-citation (Darte Huard) (Correct)
....able to capture all codes and all transformations. So far, we showed how the objective array contraction can be exactly formulated in the case of simple loops, for loop fusion and loop shifting. Extending our technique to nested loops can be done with constraints similar to those we used in [6]. However, we are not yet able to incorporate all a#ne transformations as Lim, Liao, and Lam do (but with a less aggressive objective) Song, Xu, Wang, and Li [25] address the problem of loop shifting and loop fusion for minimizing the maximal lifetime of arrays (similar objective as in [13] in ....
....with a standard ILP solver, the problem can be solved. Our technique has several restrictions so far. Here, we presented the constraints only in one dimension, i.e. for a sequence of non nested simple loops. We can extend our approach to more than one dimension with the technique introduced in [6], as long as loop fusion and loop shifting are the targeted transformations. We can also consider loops with di#erent types (loops or isolated statements that should not be fused) generalizing the technique used in [19] However, we did not try yet to incorporate more general a#ne transformations ....
Alain Darte and Guillaume Huard. Complexity of multi-dimensional loop alignment. In 19th International Symposium on Theoretical Aspects of Computer Science, Juan-les-Pins, France, March 2002.
Multi-dimensional Incremental Loop Fusion for Data.. - Verdoolaege.. (2003) (2 citations) (Correct)
No context found.
A. Darte and G. Huard. Complexity of multi-dimensional loop alignment. In STACS 2002, pages 179--191.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC