| P.-Y. Calland, A. Darte, Y. Robert, and Fr'ed'eric Vivien. Plugging anti and output dependence removal techniques into loop parallelization algorithms. Parallel Computing, 23(1--2):251--266, 1997. |
....(MSE) It may be considered as one possible trade off between parallelism and memory usage. Other possibilities include memory usage, architecture specific optimizations, etc. and also dependence removal techniques based on a priori knowledge about which dependences hamper parallel execution [6]. All these techniques are compatible with the MSE framework: requiring the expansion to be static is just an additional constraint on the whole program transformation. We present a framework to derive the maximal static expansion. The input of this framework is the (perhaps conservative) output ....
P.-Y. Calland, A. Darte, Y. Robert, and Fr'ed'eric Vivien. Plugging anti and output dependence removal techniques into loop parallelization algorithms. Parallel Computing, 23(1--2):251--266, 1997.
No context found.
Pierre-Yves Calland, Alain Darte, Yves Robert, and Fr'ed'eric Vivien. Plugging anti and output dependence removal techniques into loop parallelization algorithms. Parallel Computing, 23(12) :251--266, 1997.
No context found.
P.-Y. Calland, A. Darte, Y. Robert, and Fr'ed'eric Vivien. Plugging anti and output dependence removal techniques into loop parallelization algorithms. Parallel Computing, 23(1--2):251--266, 1997.
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