Is Cache-Oblivious DGEMM Viable?

  • John A. Gunnels
  • Fred G. Gustavson
  • Keshav Pingali
  • Kamen Yotov
Conference paper

DOI: 10.1007/978-3-540-75755-9_109

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4699)
Cite this paper as:
Gunnels J.A., Gustavson F.G., Pingali K., Yotov K. (2007) Is Cache-Oblivious DGEMM Viable?. In: Kågström B., Elmroth E., Dongarra J., Waśniewski J. (eds) Applied Parallel Computing. State of the Art in Scientific Computing. PARA 2006. Lecture Notes in Computer Science, vol 4699. Springer, Berlin, Heidelberg

Abstract

We present a study of implementations of DGEMM using both the cache-oblivious and cache-conscious programming styles. The cache-oblivious programs use recursion and automatically block DGEMM operands A,B,C for the memory hierarchy. The cache-conscious programs use iteration and explicitly block A,B,C for register files, all caches and memory. Our study shows that the cache-oblivious programs achieve substantially less performance than the cache-conscious programs. We discuss why this is so and suggest approaches for improving the performance of cache-oblivious programs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • John A. Gunnels
    • 1
  • Fred G. Gustavson
    • 1
  • Keshav Pingali
    • 2
  • Kamen Yotov
    • 2
  1. 1.IBM T. J. Watson Research Center, Yorktown Heights, NY 10598USA
  2. 2.Dept. of Computer Science, Cornell University, Ithaca, NY 14853USA

Personalised recommendations