Tile Size Selection Using Cache Organization and Data Layout

ACM SIGPLAN Notices

Volumn 30, Issue 6, 1995, Pages 279-290

  Coleman, Stephanie ^a   McKinley, Kathryn S ^b  

^a Intermetrics Inc   (United States)

^b UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976745804     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/223428.207162     Document Type: Article

References (15)

1. [BJWE92] R Bodin, W. Jalby, D. Windheiser, and C. Eisenbeis. A quantitative algorithm for data locality optimzation. In Code Generation-Concepts, Tools, Techniques. Springer-Verlag, 1992.
2. [CK92] S. Carr and K. Kennedy. Compiler blockability of numerical algorithms. In Proceedings of Supercomputing'92, Minneapolis, MN, November 1992.
3. [CL95] S. Carr and R. B. Lehoucq. A compiler-blockable algorithm for QR decomposition. In Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, San Francisco, CA, February 1995.
4. [CMT94] S. Carr, K. S. McKinley, and C. Tseng. Compiler optimizations fot improving data locality. In Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems, San Jose, CA, October 1994.
5. [Col94] S. Coleman. Selecting tile sizes based on cache and data organization. Master’s thesis, Dept, of Computer Science, University of Massachusetts, Amherst, September 1994.
6. [Ess93] K. Esseghir. Improving data locality for caches. Master’s thesis, Dept, of Computer Science, Rice University, September 1993
7. [GJG88] 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.
8. [IT88] 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.
9. [Kob87] Neal Koblitz. Graduate Texts in Mathematics. Springer-Verlag, New York, 1987.
10. [LRW91] 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, Santa Clara, CA, April 1991.
11. [NJL94] J. J. Navarro, T. Juan, and T. Lang. Mob forms: A class of multilevel block algorithms for dense linear algebra operations. In Proceedings of the 1994 ACM International Conference on Supercomputing, pages 354–363, Manchester, England, June 1994.
12. [Smi82] A. J., Smith. Cache memories. Computing Surveys, 14(3):473-530, September 1982.
13. [TGJ93] O. Temam, E. Granston, and W. Jalby. To copy or not to copy: A compile-time technique for assessing when data copying should be used to eliminate cache conflicts. In Proceedings of Supercomputing'93, Portland, OR, November 1993.
14. [WL91] 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.
15. [Wol89] M. J. Wolfe. More iteration space tiling. In Proceedings of Supercomputing'89, pages 655–664, Reno, NV, November 1989.