journal article
Dec 01, 1992
Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time
International Journal of Parallel Programming
Vol. 21
No. 6
pp. 389-420
·
Springer Science and Business Media LLC
Topics
No keywords indexed for this article. Browse by subject →
References
10
[1]
Paul Feautrier, Some efficient solutions to the affine scheduling problem, part I, onedimensional time,IJPP,21(5):313?348 (October 1992).
[2]
Randy Allen and Ken Kennedy, Automatic translation of fortran programs to vector form,ACM TOPLAS,9(4):491?542 (October 1987).
10.1145/29873.29875
[3]
Paul Feautrier, Dataflow analysis of scalar and array references,IJPP,20(1):23?53 (February 1991).
[4]
Michael L. Dowling, Optimal code parallelization using unimodular transformations,Parallel Computing,16:157?171 (1990).
10.1016/0167-8191(90)90055-e
[5]
A. Schrijver,Theory of Linear and Integer Programming, Wiley, New York (1986).
[6]
Alain Darte and Yves Robert, Affine-by-statement Scheduling of Uninform Loop Nests over Parametric Domains. Technical Report 92-16, LIP-IMAG (April 1992).
[7]
Paul Feautrier, Parametric integer programming,RAIRO Recherche Opérationelle,22:243?268 (September 1988).
[8]
Paul Feautrier and Nadia Tawbi, Résolution de Systèmes d'Inéquations Linéaires; mode d'emploi du logiciel PIP. Technical Report 90.2, IBP-MASI (January 1990).
[9]
M. Wolf and Monica S. Lam, A loop transformation theory and an algorithm to maximize parallelism,IEEE Trans. on Parallel and Distributed Systems,2(4):452?471 (October 1991).
10.1109/71.97902
[10]
Corinne Ancourt and François Irigoin, Scanning polyhedra with do loops, InProc. Third SIGPLAN Symp. on Principles and Practice of Parallel Programming, ACM Press, pp. 39?50 (April 1991).
10.1145/109626.109631
Cited By
228
Conditional Independence by Typing
ACM Transactions on Programming Lan...
Maria I. Gorinova, Andrew D. Gordon · 2021
Metrics
228
Citations
10
References
Details
- Published
- Dec 01, 1992
- Vol/Issue
- 21(6)
- Pages
- 389-420
- License
- View
Authors
Cite This Article
Paul Feautrier (1992). Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time. International Journal of Parallel Programming, 21(6), 389-420. https://doi.org/10.1007/bf01379404