DGEMM performance is data-dependent

12/11/2019

∙

by   Tom Cornebize, et al.

∙

0

∙

share

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.