On the parallelization of irregular and dynamic programs

Parallel Computing

Volumn 31, Issue 6, 2005, Pages 544-562

  Plata, Oscar ^a   Asenjo, Rafael ^a   Gutiérrez, Eladio ^a   Corbera, Francisco ^a   Navarro, Angeles ^a   Zapata, Emilio L ^a  

^a UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

Compilers; Dynamic programs; Irregular programs; Pointer based data structures

Indexed keywords

ARRAYS; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; DATA REDUCTION; JAVA PROGRAMMING LANGUAGE; PARALLEL ALGORITHMS; PRODUCT DESIGN;

DYNAMIC PROGRAMS; ILLEGULAR PROGRAMS; PARALLELIZATION; POINTER-BASED DATA STRUCTURES;

PROGRAM COMPILERS;

EID: 21244455265     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2005.02.012     Document Type: Article

References (21)

1. W. Blume, R. Doallo, and R. Eigenmann Parallel programming with Polaris IEEE Computers 29 12 1996 78 82
2. W. Blume, R. Eigenmann, The range test: a dependence test for symbolic, non-linear expressions, ACM International Conference on Supercomputing, 1994.
3. T.M. Chilimbi, Efficient representations and abstractions for quantifying and exploiting data reference locality, ACM SIGPLAN Conference on Programming Languages Design and Implementation, 2001.
4. T.M. Chilimbi, M.D. Hill, J.R. Larus, Cache-conscious structure layout, ACM SIGPLAN Conference on Programming Languages Design and Implementation, 1999.
5. F. Corbera, R. Asenjo, E.L. Zapata, New shape analysis for automatic parallelization of C codes, ACM International Conference on Supercomputing, 1999.
6. F. Corbera, R. Asenjo, E.L. Zapata, Accurate shape analysis for recursive data structures, International Workshop on Languages and Compilers for Parallel Computing, 2000.
7. M. Das, Unification-based pointer analysis with directional assignments, ACM SIGPLAN Conference on Programming Languages Design and Implementation, 2000, pp. 35-46.
8. R. Ghiya, Putting pointer analysis to work, Ph.D. thesis, School of Computer Science, McGill University, Montreal, 1998.
9. A. Gibbons Algorithmic Graph Theory 1999 Cambridge University Press
10. E. Gutiérrez, O. Plata, E.L. Zapata, A compiler method for the parallel execution of irregular reductions in scalable shared memory multiprocessors, ACM International Conference on Supercomputing, 2000.
11. E. Gutiérrez, O. Plata, E.L. Zapata, Improving parallel irregular reductions using partial array expansion, IEEE/ACM International Conference for High Performance Computing and Communications, 2001.
12. H. Han, and C.-W. Tseng Efficient compiler and run-time support for parallel irregular reductions Parallel Computing 26 13-14 2000 1861 1887
13. H. Han, C.-W. Tseng, Improving locality for adaptive irregular scientific codes, International Workshop on Languages and Compilers for Parallel Computing, 2000.
14. T. Lev-Ami, M. Sagiv, TVLA: A system for implementing static analysis, Static Analysis Symposium, 2000.
15. Y. Lin, D. Padua, On the automatic parallelization of sparse and irregular fortran programs, 4th Workshop on Languages, Compilers and Runtime Systems for Scalable Computers, 1998.
16. J. Plevyak, A. Chien, V. Karamcheti, Analysis of dynamic structures for efficient parallel execution, International Workshop on Languages and Compilers for Parallel Computing, 1993.
17. W.M. Pottenger, R. Eigenmann, Idiom recognition in the Polaris parallelizing compiler, ACM International Conference on Supercomputing, 1995.
18. A. Rogers, M.C. Carlisle, J.H. Reppy, and L.J. Hendren Supporting dynamic data structures on distributed-memory machines ACM Transactions on Programming Languages and Systems 17 2 1995 233 263
19. M. Sagiv, T. Reps, and R. Wilhelm Solving shape-analysis problems in languages with destructive updating ACM Transactions on Programming Languages and Systems 20 1 1998 1 50
20. M. Sagiv, T. Reps, R. Wilhelm, Parametric shape analysis via 3-valued logic, Symposium on Principles of Programming Languages, 1999.
21. Y. Zhu, and L. Hendren Locality analysis for parallel C programs IEEE Transactions on Parallel and Distributed Systems 10 2 1999 99 114