Complexity analysis of matrix products on multicore architectures

Abstract

The multicore revolution is underway. Classical algorithms have to be revisited in order to take hierarchical memory layout into account. In this paper, we aim at minimizing the number of cache misses paid during the execution of the matrix product kernel on a multicore processor, and we show how th achieve the best possible trade-off between shared and distributed caches.