Parallelization via constrained storage mapping optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1615, Issue , 1999, Pages 83-94

  Cohen, Albert ^a  

^a UNIVERSITY OF VERSAILLES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EXPANSION; MAPPING;

EXPANSION STRATEGIES; MAPPING OPTIMIZATION; PARALLEL EXECUTIONS; PARALLELIZATIONS; PARALLELIZING COMPILER; THEORETICAL MODELING;

CONSTRAINED OPTIMIZATION;

EID: 22644450812     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0094913     Document Type: Conference Paper

References (15)

1. D. Barthou, A. Cohen, and J. -F. Collard. Maximal static expansion. In ACM Symp. on Principles of Programming Languages (PoPL), pages 98-106, San Diego, CA, January 1998.
2. D. Barthou, J. -F. Collard, and P. Feautrier. Fuzzy array dataflow analysis. Journal of Parallel and Distributed Computing, 40:210-226, 1997.
3. L. Carter, J. Ferrante, and S. Flynn Hummel. Efficient multiprocessor parallelism via hierarchical tiling. In SIAM Conference on Parallel Processing for Scientific Computing, 1995.
4. A. Cohen and V. Lefebvre. Optimization of storage mappings for parallel programs. Technical Report 1998/46, PRiSM, U. of Versailles, 1998.
5. J.-F. Collard. The advantages of reaching definition analyses in Array (S) SA. In Proc. Workshop on Languages and Compilers for Parallel Computing, Chapel Hill, NC, August 1998. Springer-Verlag.
6. A. Darte and F. Vivien. Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs. Int. Journal of Parallel Programming, 25(6):447-496, December 1997.
7. P. Feautrier. Some efficient solution to the affine scheduling problem, part II, multidimensional time. Int. J. of Parallel Programming, 21(6), December 1992.
8. F. Irigoin and R. Triolet. Supemode partitioning. In ACM Symp. on Principles of Programming Languages (PoPL), volume 15, pages 319-328, San Diego, Cal., January 1988.
9. K. Knobe and V. Sarkar. Array SSA form and its use in parallelization. In ACM Symp. on Principles of Programming Languages (PoPL), pages 107-120, San Diego (CA), January 1998.
10. V. Lefebvre and P. Feautrier. Automatic storage management for parallel programs. Journal on Parallel Computing, 24:649-671, 1998.
11. D. E. Maydan, S. P. Amarasinghe, and M. S. Lam. Array dataflow analysis and its use in array privatization. In Proc. of A CM Conf. on Principles of Programming Languages, pages 2-15, January 1993.
12. W. Pugh. A practical algorithm for exact array dependence analysis. Communications of the ACM, 35(8):27-47, August 1992.
13. M. Mills Strout, L. Carter, J. Ferrante, and B. Simon. Schedule-independant storage mapping for loops. In ACM Int. Conf. on Arch. Support for Prog. Lang, and Oper. Sys, (ASPLOS-VIII), 1998.
14. P. Tu and D. Padua. Automatic array privatization. In Proc. Sixth Workshop on Languages and Compilers for Parallel Computing, number 768 in Lecture Notes in Computer Science, pages 500-521, August 1993. Portland, Oregon.
15. D. G. Wonnacott. Constraint-Based Array Dependence Analysis. PhD thesis, University of Maryland, 1995.