Advertisement

Storage Mapping Optimization for Parallel Programs

  • Albert Cohen
  • Vincent Lefebvre
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1685)

Abstract

Data dependences are known to hamper efficient parallelization of programs. Memory expansion is a general method to remove dependences in assigning distinct memory locations to dependent writes. Parallelization via memory expansion requires both moderation in the expansion degree and efficiency at run-time.We present a general storage mapping optimization framework for imperative programs, applicable to most loop nest parallelization techniques.

Keywords

Memory Location Dependence Graph Loop Nest Storage Mapping Execution Order 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [1]
    D. Barthou, J.-F. Collard, and P. Feautrier. Fuzzy array dataflow analysis. Journal of Parallel and Distributed Computing, 40:210–226, 1997.Google Scholar
  2. [2]
    L. Carter, J. Ferrante, and S. Flynn Hummel. Efficient multiprocessor parallelism via hierarchical tiling. In SIAM Conference on Parallel Processing for Scientific Computing, 1995.Google Scholar
  3. [3]
    A. Cohen and V. Lefebvre. Optimization of storage mappings for parallel programs. Technical Report 1998/46, PRiSM, U. of Versailles, 1998.Google Scholar
  4. [4]
    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.Google Scholar
  5. [5]
    B. Creusillet. Array Region Analyses and Applications. PhD thesis, Ecole des Mines de Paris, December 1996.Google Scholar
  6. [6]
    R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, and F.K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451–490, October 1991.Google Scholar
  7. [7]
    A. Darte and F. Vivien. Optimal_ne and medium grain parallelism detection in polyhedral reduced dependence graphs. Int. Journal of Parallel Programming, 25(6):447–496, December 1997.Google Scholar
  8. [8]
    P. Feautrier. Dataflow analysis of scalar and array references. Int. Journal of Parallel Programming, 20(1):23–53, February 1991.Google Scholar
  9. [9]
    P. Feautrier. Some efficient solution to the affine scheduling problem, part II, multidimensional time. Int. J. of Parallel Programming, 21(6), December 1992.Google Scholar
  10. [10]
    F. Irigoin and R. Triolet. Supernode partitioning. In Proc. 15th POPL, pages 319–328, San Diego, Cal., January 1988.Google Scholar
  11. [11]
    V. Lefebvre and P. Feautrier. Automatic storage management for parallel programs. Journal on Parallel Computing, 24:649–671, 1998.Google Scholar
  12. [12]
    D.E. Maydan, S.P. Amarasinghe, and M.S. Lam. Array dataflow analysis and its use in array privatization. In Proc. of ACM Conf. on Principles of Programming Languages, pages 2–15, January 1993.Google Scholar
  13. [13]
    W. Pugh. A practical algorithm for exact array dependence analysis. Communications of the ACM, 35(8):27–47, August 1992.Google Scholar
  14. [14]
    Fabien Quilleré and Sanjay Rajopadhye. Optimizing memory usage in the polyhedral model. Technical Report 1228, IRISA, January 1999.Google Scholar
  15. [15]
    M. Mills Strout, L. Carter, J. Ferrante, and B. Simon. Schedule-independent storage mapping for loops. In ACM Int. Conf. on Arch. Support for Prog. Lang.and Oper. Sys. (ASPLOS-VIII), 1998.Google Scholar
  16. [16]
    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.Google Scholar
  17. [17]
    D.G. Wonnacott. Constraint-Based Array Dependence Analysis. PhD thesis, University of Maryland, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Albert Cohen
    • 1
  • Vincent Lefebvre
    • 1
  1. 1.PRiSM, Université de VersaillesVersaillesFrance

Personalised recommendations