Optimal Fine and Medium Grain Parallelism Detection in Polyhedral Reduced Dependence Graphs
Authors:
- 1 December 1997
- journal article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 25 (6) , 447-496
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Combining Retiming and Scheduling Techniques for Loop Parallelization and Loop TilingParallel Processing Letters, 1997
- Plugging anti and output dependence removal techniques into loop parallelization algorithmParallel Computing, 1997
- An asymptotically optimal affine schedule on bounded convex polyhedric domains1996
- REVISITING THE DECOMPOSITION OF KARP, MILLER AND WINOGRADParallel Processing Letters, 1995
- Affine-by-Statement Scheduling of Uniform and Affine Loop Nests over Parametric DomainsJournal of Parallel and Distributed Computing, 1995
- Constructive methods for scheduling uniform loop nestsIEEE Transactions on Parallel and Distributed Systems, 1994
- LINEAR SCHEDULING IS NEARLY OPTIMALParallel Processing Letters, 1991
- A loop transformation theory and an algorithm to maximize parallelismIEEE Transactions on Parallel and Distributed Systems, 1991
- Semantical interprocedural parallelization1991
- Analysis of Programs for Parallel ProcessingIEEE Transactions on Electronic Computers, 1966