Matrix Multiplication: A Case Study of Enhanced Data Cache Utilization

ACM Journal of Experimental Algorithmics

Volumn 4, Issue , 1999, Pages 3-

  Eiron, Nadav ^a   Rodeh, Michael ^b   Steinwarts, Tris ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

Algorithms; BLAS; Blocking; Cache; Matrix Multiplication; Performance; Prefetching

Indexed keywords

EID: 84957880482     PISSN: 10846654     EISSN: 10846654     Source Type: Journal    
DOI: 10.1145/347792.347806     Document Type: Article

References (17)

1. Agarwal, R. C., Gustavson, F. G., and Zubair, M. 1994. Improving performance of linear algebra algorithms for dense matrices, using algorithmic prefetch. IBM J. of Research and Development 38, 3, 265-275.
2. Callahan, D., Kennedy, K., and Porterfield, A. 1991a. The cache performance and optimizations of blocked algorithms. In Proceedings of ASPLOS’91 (1991), pp. 63-74.
3. Callahan, D., Kennedy, K., and Porterfield, A. 1991b. Software prefetching. In Proceedings of ASPLOS’91 (1991), pp. 40-52.
4. Digital Equipment Corp. 1998. 21164 Alpha Microprocessor Data Sheet. Digital Equipment Corp.
5. Eiron, N., Rodeh, M., and Steinwarts, I. 1998. Matrix multiplication: A case study of algorithm engineering. In Proceedings of WAE’98 (August 1998), pp. 40-52. Max-Plank-Institut für Informatik.
6. Farkas, K. and Jouppi, N. 1994. Complexity/performance tradeoffs with non-blocking loads. In Proceedings of JSCA’94 (1994), pp. 211-222.
7. Gustavson, F. G. 1998. Personal Communication.
8. Hennessy, J. L. and Patterson, D. A. 1996. Computer Architecture: A Quantitive Approach (Second ed.). Morgan Kaufmann Publishers Inc.
9. IBM Corp. 1997. IBM Engineering and Scientific Subroutine Library for AIX, Version 3 - Guide and Reference. IBM Corp.
10. IBM Microelectronics and Motorola Inc. 1994. PowerPC 6O4 RISC Microprocessor User's Manual. IBM Microelectronics and Motorola Inc.
11. Lam, M. S. 1988. Software pipelining: An effective technique for vliw machines. In Proceedings of SIGPLAN’88 (1988), pp. 318-328.
12. Lee, J. H., Lee, M. Y., Choi, S. U., and Park, M. S. 1994. Reducing cache conflicts in data cache prefetching. Computer Architecture News 22, 4, 71-77.
13. Mowry, T. C. 1994. Tolerating Latency Through Software-Controlled Data Prefetching. Ph. D. thesis, Stanford University.
14. Mowry, T. C., Lam, M. S., and Gupta, A. 1992. Design and evaluation of a compiler algorithm for data prefetching. In Proceedings of ASPLOS’92 (1992), pp. 62-73.
15. Navarro, J. J., Gaecía-Diego, E., and Heeeeeo, J. R. 1992. Data prefetching and multilevel blocking for linear algebra operations. In Proceedings of ICS’96 (1992), pp. 109-116.
16. Stewaet, K. E. 1994. Using the xl compiler options to improve application performance. In PowerPC and P0WER2, Technical Aspects of the New IBM RISC System/6000. IBM Corp.
17. Temam, O., Granston, E. D., and Jalby, W. 1993. 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 (1993), pp. 410-419.