Minimal data dependence abstractions for loop transformations: Extended version
- 1 August 1995
- journal article
- Published by Springer Science and Business Media LLC in International Journal of Parallel Programming
- Vol. 23 (4), 359-388
- https://doi.org/10.1007/bf02577771
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Loop Transformations for Restructuring Compilers: The FoundationsPublished by Springer Science and Business Media LLC ,1993
- A practical algorithm for exact array dependence analysisCommunications of the ACM, 1992
- Time optimal linear schedules for algorithms with uniform dependenciesIEEE Transactions on Computers, 1991
- Dataflow analysis of array and scalar referencesInternational Journal of Parallel Programming, 1991
- A loop transformation theory and an algorithm to maximize parallelismIEEE Transactions on Parallel and Distributed Systems, 1991
- Supernode partitioningPublished by Association for Computing Machinery (ACM) ,1988
- 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
- The Organization of Computations for Uniform Recurrence EquationsJournal of the ACM, 1967
- Analysis of Programs for Parallel ProcessingIEEE Transactions on Electronic Computers, 1966