Compiler analysis of irregular memory accesses

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2000, Pages 157-168

  Lin, Y ^a   Padua, D ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); DATA FLOW ANALYSIS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROGRAM COMPILERS; QUERY LANGUAGES; RECURSIVE FUNCTIONS;

COMPILER ANALYSIS; IRREGULAR MEMORY ACCESS; LOOP TRANSFORMATION TECHNIQUE; TRADITIONAL ARRAY ANALYSIS;

RANDOM ACCESS STORAGE;

EID: 0034449442     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. Automatic recognition of induction variables and recurrence relations by abstract interpretation
2. A technique for summarizing data access and its use in parallelism-enhancing transformations
3. Data dependence in ordinary programs
4. Parallel programming with polaris
5. An overview of symbolic analysis techniques needed for the effective parallelization of the perfect benchmarks
6. The range test: A dependence test for symbolic, non-linear expressions
7. Analysis of interprocedural side effects in a parallel programming environment
8. Interprocedural array region analysis
9. A practical framework for demand-driven interprocedural data flow analysis
10. Array expansion
11. Beyond induction variables: Detecting and classifying sequences using a demand-driven SSA form
12. Structured dataflow analysis for arrays and its use in an optimizing compiler
13. Symbolic array dataflow analysis for array privatization and program parallelization
14. Detecting coarse-grain parallelism using an interprocedural parallelizing compiler
15. Analysis and transformation in the ParaScope editor
16. Array privatization for parallel execution of loops
17. On the automatic parallelization of sparse and irregular fortran programs
18. Analysis of irregular single-indexed array accesses and its applications in compiler optimizations
19. Array-data flow analysis and its use in array privatization
20. Dependence analysis of arrays subscripted by index arrays
21. Simplification of array access patterns for compiler optimizations
22. Run-time parallelization and scheduling of loops
23. Loop monotonic statements
24. Direct parallelization of call statements
25. Automatic array privatization
26. Beyond induction variables
27. A synchronization scheme and its applications for large multiprocessor systems