Premium
Frequency scaling and energy efficiency regarding the Gauss‐Jordan elimination scheme with application to the matrix‐sign‐function on OpenPOWER 8
Author(s) -
Köhler Martin,
Saak Jens
Publication year - 2018
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.4504
Subject(s) - sign (mathematics) , gaussian elimination , matrix (chemical analysis) , scaling , function (biology) , energy (signal processing) , computer science , gauss , algorithm , scheme (mathematics) , inverse , frequency scaling , energy consumption , mathematics , mathematical analysis , physics , statistics , engineering , quantum mechanics , electrical engineering , geometry , materials science , evolutionary biology , biology , composite material , gaussian
Summary The Gauss‐Jordan Elimination scheme is an alternative to the L U decomposition for solving linear systems or computing the inverse of a matrix. We develop a multi‐GPU aware implementation of this algorithm on an OpenPOWER 8 system with application to the Matrix Sign Function. Thereby, we analyze the influence of the CPU clock frequency scaling on the overall energy consumption. The results show possible energy saving of 14.2% without a noteworthy increase of the runtime.