Fast greedy weighted fusion

International Journal of Parallel Programming

Volumn 29, Issue 5, 2001, Pages 463-491

  Kennedy, Ken ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

Cache reuse; Compiler optimization; Greedy heuristics; Loop fusion; Memory hierarchy

Indexed keywords

CACHE REUSE; COMPILER OPTIMIZATION; GREEDY HEURISTICS; LOOP FUSION; MEMORY HIERARCHY;

ALGORITHMS; ASYMPTOTIC STABILITY; CACHE MEMORY; CONFORMAL MAPPING; DATA STORAGE EQUIPMENT; DATA STRUCTURES; FORTRAN (PROGRAMMING LANGUAGE); GRAPH THEORY; HEURISTIC METHODS; HIERARCHICAL SYSTEMS; ITERATIVE METHODS; OPTIMIZATION; SET THEORY;

PROGRAM COMPILERS;

EID: 10844232335     PISSN: 08857458     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. G. Gao, R. Olsen, V. Sarkar, and R. Thekkath, Collective Loop Fusion for Array Contraction, Proc. Fifth Workshop on Languages and Compilers for Parallel Computing, New Haven, Connecticut (August 1992).
2. K. Kennedy and K. McKinley, Maximizing Loop Parallelism and Improving Data Locality via Loop Fusion and Distribution, U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua (eds.), Languages and Compilers for Parallel Computing, Lecture Notes in Computer Science, Number 768, pp. 301 320, Springer-Verlag, Berlin (1993).
3. N. Megiddo and V. Sarkar, Optimal Weighted Loop Fusion for Parallel Programs, Proc. Ninth Ann. ACM Symp. Parallel Algorithms and Architectures, Newport, Rhode Island (June 1997).
4. R. Allen and K. Kennedy, Advanced Compilation for High Performance Computers, Morgan Kauffman (October 2001).
5. D.-C. Ju, C.-L. Wu, and P. Carini, The Classification, Fusion, and Parallelization of Array Language Primitives, IEEE Trans. Parallel and Distributed Systems 5(10): 1113-1120 (October 1994).
6. C. Ding and K. Kennedy, Resource-Constrained Loop Fusion, Technical Report, Department of Computer Science, Rice University (October 2000).
7. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, Design and Analysis of Computer Algorithms, Exercise 2.12. Addison Wesley, Reading, Massachusetts (1974).
8. A. Goldberg and R. Paige, Stream Processing, ACM Sympos. Lisp and Functional Progr., 228-234 (August 1984).
9. R. Allen, D. Callahan, and K. Kennedy, Automatic Decomposition of Scientific Programs for Parallel Execution, 14th ACM Sympos. Principles of Progr. Lang., Munich, Germany (January 1987).
10. K. Kennedy and K. McKinley, Typed Fusion with Applications to Parallel and Sequential Code Generation, Technical Report CRPC-TR94646, Center for Research on Parallel Computation, Riche University, 1994.
11. J. R. Allen, Dependence Analysis for Subscripted Variables and Its Application to Program Transformations, Ph.D dissertation, Department of Mathematical Science, Rice University (May 1983).
12. J. R. Allen and K. Kennedy, Vector Register Allocation, IEEE Trans. Computers 41:1290 1317 (October 1992).
13. S. Carr, Memory Hierarchy Management, Ph.D. thesis, Department of Computer Science, Rice University (September 1992).
14. S. Carr, D. Callahan, and K. Kennedy, Improving Register Allocation for Subscripted Variables, Proc. ACM SIGPLAN Conf. Progr. Lang. Design and Implementation, White Plains, New York (June 1990).
15. A. Darte, On the Complexity of Loop Fusion, Proc. PACT'99, Newport Beach, California (October 1999).
16. C. Ding and K. Kennedy, Memory Bandwidth Bottleneck and Its Amelioration by a Compiler, Proc. Int. Parallel and Distributed Proc. Symp., Cancun, Mexico (May 2000).
17. A. Goldberg and R. Tarjan, A New Approach to the Maximum-Flow Problem, J. Assoc. Computing Machinery 35(4):921-940 (October 1988).
18. V. Sarkar and G. Gao, Optimization of Array Accesses by Collective Loop Transformations, Proc. ACM Inter. Conf. Supercomputing, Cologne, Germany (June 1991).
19. C. Ding, Improving Effective Bandwidth Through Compiler Enhancement of Global and Dynamic Cache Reuse, Ph.D. thesis, Department of Computer Science, Rice University (January 2000).