DMCA
Is Cache Oblivious DGEMM a Viable Alternative?
BibTeX
@MISC{Yotov_iscache,
author = {K. Yotov and T. Roeder and K. Pingali and J. Gunnels and F. Gustavson},
title = {Is Cache Oblivious DGEMM a Viable Alternative?},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. We present an in-depth study of various implementations of DGEMM, using both the recursive and iterative programming styles. Recursive algorithms for DGEMM are usually cache-oblivious and they automatically block DGEMM’s operands A, B, C for the memory hierarchy. Iterative algorithms for DGEMM explicitly block A, B, C for the L1 cache, higher caches and memory. Our study shows that recursive DGEMM implementations cannot achieve the high performance of blocked iterative algorithms. 1 A study of Recursive and Interative Algorithms for DGEMM The performance of DGEMM on modern computers is limited by the performance of the memory system in two ways. First, the latency of memory accesses can be many hundreds of cycles, so the processor may be stalled most of the time, waiting for reads to complete. Second, the bandwidth from memory is usually far less than the rate at which the processor can consume data. This contribution examines in depth these limitations for both recursive and iterative programming styles. We describe the results of a study of the performance of highly-optimized cache-oblivious and cache-conscious programs for DGEMM on four modern architectures:
Keyphrases
viable alternative cache oblivious dgemm iterative programming style memory access memory hierarchy memory system interative algorithm modern computer various implementation many hundred recursive algorithm iterative algorithm cache-conscious program blocked iterative algorithm high performance l1 cache in-depth study recursive dgemm implementation modern architecture
