Abstract
In this paper we introduce a model for the total energy consumption of the Cholesky factorization on a multicore processor. Our model assumes a task- parallel execution of the factorization process, with con- currency leveraged via a run-time as those recently pro- posed in projects like SMPSs, PLASMA or libflame, and decomposes the power usage into its uncore, static and dynamic components. A few simple experiments provide experimental data (parameters) with enough accuracy to assemble the model, which can then be used to estimate the actual power dissipation and en- ergy consumption of the global algorithm. Experimen- tal results on an 8-core platform equipped with Intel Xeon processors reveal the precision of the model.
