Power profiling of Cholesky and QR factorizations on distributed memory systems
Online Publication Date2012-08-30
Print Publication Date2014-05
Permanent link to this recordhttp://hdl.handle.net/10754/562284
MetadataShow full item record
AbstractThis paper presents the power profile of two high performance dense linear algebra libraries on distributed memory systems, ScaLAPACK and DPLASMA. From the algorithmic perspective, their methodologies are opposite. The former is based on block algorithms and relies on multithreaded BLAS and a two-dimensional block cyclic data distribution to achieve high parallel performance. The latter is based on tile algorithms running on top of a tile data layout and uses fine-grained task parallelism combined with a dynamic distributed scheduler (DAGuE) to leverage distributed memory systems. We present performance results (Gflop/s) as well as the power profile (Watts) of two common dense factorizations needed to solve linear systems of equations, namely Cholesky and QR. The reported numbers show that DPLASMA surpasses ScaLAPACK not only in terms of performance (up to 2X speedup) but also in terms of energy efficiency (up to 62 %). © 2012 Springer-Verlag (outside the USA).
CitationBosilca, G., Ltaief, H., & Dongarra, J. (2012). Power profiling of Cholesky and QR factorizations on distributed memory systems. Computer Science - Research and Development, 29(2), 139–147. doi:10.1007/s00450-012-0224-2