A unified framework for schedule and storage optimization

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

Volumn , Issue , 2001, Pages 232-242

  Thies, W ^a   Vivien, F ^a   Sheldon, J ^a   Amarasinghe, S ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NUMERICAL ANALYSIS; PARALLEL PROCESSING SYSTEMS; PROGRAM COMPILERS; SCHEDULING; VECTORS;

MULTI DIMENSIONAL ARRAYS;

STORAGE ALLOCATION (COMPUTER);

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

References (18)

1. Maximal static expansion
2. Parallelization via constrained storage mapping optimization
3. Array expansion
4. Dataflow analysis of array and scalar references
5. Some efficient solutions to the affine scheduling problem, part I. One-dimensional time
6. Some efficient solutions to the affine scheduling problem, part II. Multidimensional time
7. Supernode partitioning
8. Automatic storage management for parallel programs
9. Maximizing parallelism and minimizing synchronization with affine transforms
10. Parameterized polyhedra and their vertices
11. A general method applicable to the search of similarities in the amino acid sequence of two proteins
12. The Omega test: A fast and practical integer programming algorithm for dependence analysis
13. Schedule-independent storage mapping for loops
14. Memory reuse analysis in the polyhedral model