Autor:	Cornebize, Tom, Legrand, Arnaud
Rok vydání:	2019
Předmět:	Computer Science - Distributed Parallel and Cluster Computing
Druh dokumentu:	Working Paper
Popis:	The DGEMM function is a widely used implementation of the matrix product. While the asymptotic complexity of the algorithm only depends on the sizes of the matrices, we show that the performance is significantly impacted by the matrices content. Our experiments show that this may be due to bit flips in the CPU causing an energy consumption overhead.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1912.05381 Zobrazit plný text záznamu View this record from Arxiv