On the complexity of loop fusion
Author:
- Alain DarteADAlain Darte
- 1 July 2000
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 26 (9) , 1175-1193
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- A compiler algorithm to reduce invalidation latency in virtual shared memory systems2002
- Loop parallelization algorithms: From parallelism extraction to code generationParallel Computing, 1998
- Optimal Fine and Medium Grain Parallelism Detection in Polyhedral Reduced Dependence GraphsInternational Journal of Parallel Programming, 1997
- Optimal weighted loop fusion for parallel programs1997
- More on the complexity of common superstring and supersequence problemsTheoretical Computer Science, 1994
- Maximizing loop parallelism and improving data locality via loop fusion and distribution1994
- Collective loop fusion for array contraction1993
- Routing Printed Circuit Cards Through an Assembly CellOperations Research, 1991
- Automatic translation of FORTRAN programs to vector formACM Transactions on Programming Languages and Systems, 1987
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978