Plugging anti and output dependence removal techniques into loop parallelization algorithm

Parallel Computing

Volumn 23, Issue 1-2, 1997, Pages 251-266

  Calland, Pierre Yves ^a   Darte, Alain ^a   Robert, Yves ^a   Vivien, Frédéric ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

Anti dependence; Dependence removal; Loop parallelization algorithm; Output dependence

Indexed keywords

BUFFER STORAGE; PARALLEL ALGORITHMS; PERCOLATION (COMPUTER STORAGE); STORAGE ALLOCATION (COMPUTER);

LOOP PARALLELIZATION ALGORITHMS;

PARALLEL PROCESSING SYSTEMS;

EID: 0031118682     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(96)00108-1     Document Type: Article

References (17)

1. J.R. Allen and K. Kennedy, Automatic translation of Fortran programs to vector form, ACM Toplas 9 (1987) 491-452.
2. D.F. Bacon, S.L. Graham and O.J. Sharp, Compiler transformations for high-performance computing, ADM Comput. Surv. 26(4) (1994).
3. U. Banerjee, R. Eigenmann, A. Nicolau and D.A. Padua, Automatic program parallelization, Proc. IEEE 81(2) (1993) 211-243.
4. T. Brandes, The importance of direct dependences for automatic parallelization, in: Int. Conf. of Supercomputing (1988) 407-417.
5. D. Callahan, A Global Approach to Detection of Parallelism, Ph.D. thesis, Dept. of Computer Science, Rice University, Houston, TX, 1987.
6. P.-Y. Calland, A. Darte, Y. Robert and F. Vivien, On the removal of anti and output dependences, in: J. Fortes, C. Mongenet, K. Parhi and V. Taylor, eds., Application Specific Systems, Architectures and Processors (IEEE Computer Society Press, 1996) 353-364.
7. Z. Chamski, Environnement logiciel de programmation d'un accélérateur de calcul parallèle, Ph.D. thesis, Universit de Rennes, Rennes, France, 1993, No. 957.
8. A. Darte and F. Vivien, A classification of nested loops parallelization algorithms, in; INRIA-IEEE Symp. on Emerging Technologies and Factory Automation (IEEE Computer Society Press, 1995) 217-224.
9. A. Darte and F. Vivien, Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs, Technical Report 96-06, LIP, ENS-Lyon, France, April 1996.
10. P. Feautrier, Dataflow analysis of array and scalar references, Int. J. Parallel Program. 20(1) (1991) 23-51.
11. J. Gu, Z. Li and G. Lee, Symbolic array dataflow analysis for array privatization and program parallelization, in: Supercomputing 95 (1995).
12. V. Lefebvre and P. Feautrier, Gestion de la mémoire dans les programmes parallèles, in: R. Castanet and J. Roman, eds., RenPar'8 (LaBRII, Université de Bordeaux, France, May 1996) 149-152 (in French).
13. D.E. Maydan, S.P. Amarasinghe and M. Lam, Array dataflow analysis and its use in array privatization, in: Principles of Programming Languages (1993).
14. D.A. Padua and M.J. Wolfe, Advanced compiler optimizations for supercomputers, Commun. ACM 29(12) (December 1986) 1184-1201.
15. M. Wolfe, The Tiny loop restructuring research tool, in: H.D. Schwetman, ed., Int. Conf. on Parallel Processing, Vol. II (CRC Press, 1991) 46-53.
16. M. Wolfe, High Performance Compilers For Parallel Computing (Addison-Wesley Publishing Company, 1996).
17. H. Zima and B. Chapman, Supercompilers for Parallel and Vector Computers (ACM Press, 1990).