A comparison of compiler tiling algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1575, Issue , 1999, Pages 168-183

  Rivera, Gabriel ^a   Tseng, Chau Wen ^a  

^a University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM COMPILERS;

ASSOCIATIVITY; CONFLICT MISS; DATA LOCALITY; MATRIX MULTIPLY; MATRIX SIZE; MULTIPLE LOOPS; RUNTIMES;

MATRIX ALGEBRA;

EID: 84949210195     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-49051-7_12     Document Type: Conference Paper

References (26)

1. D. Bacon, J.-H. Chow, D.-C. Ju, K. Muthukumar, and V. Sarkar. A compiler framework for restructuring data declarations to enhance cache and TLB effectiveness. In Proceedings of CASCON’94, Toronto, Canada, October 1994.
2. D. Bailey. Unfavorable strides in cache memory systems. Technical Report RNR-92-015, NASA Ames Research Center, May 1992.
3. D. Callahan, S. Carr, and K. Kennedy. Improving register allocation for subscripted variables. In Proceedings of the SIGPLAN’90 Conference on Programming Language Design and Implementation, White Plains, NY, June 1990.
4. S. Carr and K. Kennedy. Compiler blockability of numerical algorithms. In Proceedings of Supercomputing’92, Minneapolis, MN, November 1992.
5. M. Cierniak and W. Li. Unifying data and control transformations for distributed shared-memory machines. In Proceedings of the SIGPLAN’95 Conference on Programming Language Design and Implementation, La Jolla, CA, June 1995.
6. S. Coleman and K. S. McKinley. Tile size selection using cache organization and data layout. In Proceedings of the SIGPLAN’95 Conference on Programming Language Design and Implementation, La Jolla, CA, June 1995
7. K. Esseghir. Improving data locality for caches. Master’s thesis, Dept. of Computer Science, Rice University, September 1993.
8. J. Ferrante, V. Sarkar, and W. Thrash. On estimating and enhancing cache effectiveness. In U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors, Languages and Compilers for Parallel Computing, Fourth International Workshop, Santa Clara, CA, August 1991. Springer-Verlag.
9. D. Gannon, W. Jalby, and K. Gallivan. Strategies for cache and local memory management by global program transformation. Journal of Parallel and Distributed Computing, 5(5):587-616, October 1988.
10. S. Ghosh, M. Martonosi, and S. Malik. Cache miss equations: An analytical representation of cache misses. In Proceedings of the 1997 ACM International Conference on Supercomputing, Vienna, Austria, July 1997.
11. F. Irigoin and R. Triolet. Supernode partitioning. In Proceedings of the Fifteenth Annual ACM Symposium on the Principles of Programming Languages, San Diego, CA, January 1988.
12. M. Kandemir, J. Ramanujam, and A. Choudhary. A compiler algorithm for optimizing locality in loop nests. In Proceedings of the 1997 ACM International Conference on Supercomputing, Vienna, Austria, July 1997.
13. M. Lam, E. Rothberg, and M. E. Wolf. The cache performance and optimizations of blocked algorithms. In Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-IV), Santa Clara, CA, April 1991.
14. A. Lebeck and D. Wood. Cache profiling and the SPEC benchmarks: A case study. IEEE Computer, 27(10):15-26, October 1994.
15. N. Manjikian and T. Abdelrahman. Fusion of loops for parallelism and locality. IEEE Transactions on Parallel and Distributed Systems, 8(2):193-209, February 1997.
16. N. Mitchell, L. Carter, J. Ferrante, and K. Hogstedt. Quantifying the multi-level nature of tiling interactions. In Proceedings of the Tenth Workshop on Languages and Compilers for Parallel Computing, Minneapolis, MN, August 1997.
17. K. S. McKinley, S. Carr, and C.-W. Tseng. Improving data locality with loop transformations. ACM Transactions on Programming Languages and Systems, 18(4):424-453, July 1996.
18. K. S. McKinley and O. Temam. A quantitative analysis of loop nest locality. In Proceedings of the Eighth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VIII), Boston,MA, October 1996.
19. M. O’Boyle and P. Knijnenburg. Non-singular data transformations: Definition, validity, and applications. In Proceedings of the 1997 ACM International Conference on Supercomputing, Vienna, Austria, July 1997.
20. G. Rivera and C.-W. Tseng. Data transformations for eliminating conflict misses. In Proceedings of the SIGPLAN’98 Conference on Programming Language Design and Implementation, Montreal, Canada, June 1998.
21. G. Rivera and C.-W. Tseng. Eliminating conflict misses for high performance architectures. In Proceedings of the 1998 ACM International Conference on Supercomputing, Melbourne, Australia, July 1998.
22. O. Temam, C. Fricker, and W. Jalby. Cache interference phenomena. In Proceedings of the 1994 ACM SIGMETRICS Conference on Measurement & Modeling Computer Systems, Santa Clara, CA, May 1994.
23. O. Temam, E. Granston, and W. Jalby. To copy or not to copy: A compiletime technique for assessing when data copying should be used to eliminate cache conflicts. In Proceedings of Supercomputing’93, Portland, OR, November 1993.
24. M. Wolf, D. Maydan, and D.-K. Chen. Combining loop transformations considering caches and scheduling. In Proceedings of the 29th IEEE/ACM International Symposium on Microarchitecture, Paris, France, December 1996.
25. M. E Wolf and M. Lam. A data locality optimizing algorithm. In Proceedings of the SIGPLAN’91 Conference on Programming Language Design and Implementation, Toronto, Canada, June 1991.
26. M. J. Wolfe. More iteration space tiling. In Proceedings of Supercomputing’89, Reno, NV, November 1989