A unified framework for schedule and storage optimization

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 36, Issue 5, 2001, Pages 232-242

  Thies, William ^a   Vivien, Frédéric ^b   Sheldon, Jeffrey ^a   Amarasinghe, Saman ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITÉ DE STRASBOURG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 18844383699     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/381694.378852     Document Type: Article

References (18)

1. D. Barthou, A. Cohen, and J. Collard. Maximal static expansion. In Principles of Programming Languages, pages 98-106, San Diego, CA, Jan. 1998.
2. A. Cohen. Parallelization via constrained storage mapping optimization. Lecture Notes in Computer Science, 1615:83-94, 1999.
3. A. Cohen and V. Lefebvre. Optimization of storage mappings for parallel programs. Technical Report 1998/46, PRiSM, U. of Versailles, 1988.
4. A. Darte, Y. Robert, and F. Vivien. Scheduling and Automatic Parallelization. Birkhäuser Boston, 2000.
5. P. Feautrier. Array expansion. In ACM Int. Conf. on Supercomputing, pages 429-441, 1988.
6. P. Feautrier. Dataflow analysis of array and scalar references. Int. J. of Parallel Programming, 20(1):23-51, 1991.
7. P. Feautrier. Some efficient solutions to the affine scheduling problem. part I. one-dimensional time. Int. J. of Parallel Programming, 21(5):313-347, Oct. 1992.
8. P. Feautrier. Some efficient solutions to the affine scheduling problem, part II. multidimensional time. Int. J. of Parallel Programming, 21(6):389-420, Dec. 1992.
9. P. Feautrier, J.-F. Collard, M. Barreteau, D. Barthou, A. Cohen, and V. Lefebvre. The interplay of expansion and scheduling in paf. Technical Report 1998/6, PRiSM, U. of Versailles, 1988.
10. F. Irigoin and R. Triolet. Supernode partitioning. In Proc. 15th Annual AGM Symp. Principles of Prog. Languages, pages 319-329, San Diego, CA, Jan. 1988.
11. V. Lefebvre and P. Feautrier. Automatic storage management for parallel programs. Parallel Computing, 24(3-4):649-671, May 1998.
12. A. Lim and M. Lam. Maximizing parallelism and minimizing synchronization with affine transforms. In Proceedings of the 24th Annual ACM SIGPLAN-SIGACT Symp. on Principles of Prog. Languages, Jan. 1997.
13. V. Loechner and D. K. Wilde. Parameterized polyhedra and their vertices. Int. J. of Parallel Programming, 25(6):525-549, Dec. 1997.
14. S. B. Needleman and C. D. Wunsch. A general method applicable to the search of similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48:443-453, 1970.
15. W. Pugh. The Omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM, 8:102-114, Aug. 1992.
16. A. Schrijver. Theory of Linear and Integer Programming. John Wiley and Sons, New York, 1986.
17. M. M. Strout, L. Carter, J. Ferrante, and B. Simon. Schedule-independent storage mapping for loops. In Architectural Support for Programming Languages and Operating Systems, pages 24-33, 1998.
18. D. Wilde and S. Rajopadhye. Memory reuse analysis in the polyhedral model. Parallel Processing Letters, 7(2):203-215, June 1997.