Loop parallelization algorithms: From parallelism extraction to code generation
- 1 May 1998
- journal article
- Published by Elsevier BV in Parallel Computing
- Vol. 24 (3-4), 421-444
- https://doi.org/10.1016/s0167-8191(98)00020-9
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Parallelizing Nested Loops with Approximation of Distance Vectors: A SurveyParallel Processing Letters, 1997
- Maximizing parallelism and minimizing synchronization with affine transformsPublished by Association for Computing Machinery (ACM) ,1997
- Minimal data dependence abstractions for loop transformations: Extended versionInternational Journal of Parallel Programming, 1995
- Compiler transformations for high-performance computingACM Computing Surveys, 1994
- Some efficient solutions to the affine scheduling problem. Part II. Multidimensional timeInternational Journal of Parallel Programming, 1992
- A loop transformation theory and an algorithm to maximize parallelismIEEE Transactions on Parallel and Distributed Systems, 1991
- Automatic translation of FORTRAN programs to vector formACM Transactions on Programming Languages and Systems, 1987
- The parallel execution of DO loopsCommunications of the ACM, 1974
- Analysis of Programs for Parallel ProcessingIEEE Transactions on Electronic Computers, 1966