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.
Document type :
Reports
Complete list of metadatas

https://hal-lara.archives-ouvertes.fr/hal-02102826
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 4:33:52 PM
Last modification on : Friday, April 19, 2019 - 1:38:16 AM

File

LIP-RR_08-41.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02102826, version 1

Collections

Citation

Mathias Jacquelin, Loris Marchal, Yves Robert. Complexity analysis of matrix products on multicore architectures. [Research Report] LIP RR-2008-41, Laboratoire de l'informatique du parallélisme. 2008, 16p. ⟨hal-02102826⟩

Share

Metrics

Record views

26

Files downloads

14