Enhancing parallelism of tile bidiagonal transformation on multicore architectures using tree reduction
Permanent link to this recordhttp://hdl.handle.net/10754/575758
MetadataShow full item record
AbstractThe objective of this paper is to enhance the parallelism of the tile bidiagonal transformation using tree reduction on multicore architectures. First introduced by Ltaief et. al [LAPACK Working Note #247, 2011], the bidiagonal transformation using tile algorithms with a two-stage approach has shown very promising results on square matrices. However, for tall and skinny matrices, the inherent problem of processing the panel in a domino-like fashion generates unnecessary sequential tasks. By using tree reduction, the panel is horizontally split, which creates another dimension of parallelism and engenders many concurrent tasks to be dynamically scheduled on the available cores. The results reported in this paper are very encouraging. The new tile bidiagonal transformation, targeting tall and skinny matrices, outperforms the state-of-the-art numerical linear algebra libraries LAPACK V3.2 and Intel MKL ver. 10.3 by up to 29-fold speedup and the standard two-stage PLASMA BRD by up to 20-fold speedup, on an eight socket hexa-core AMD Opteron multicore shared-memory system. © 2012 Springer-Verlag.
CitationLtaief, H., Luszczek, P., & Dongarra, J. (2012). Enhancing Parallelism of Tile Bidiagonal Transformation on Multicore Architectures Using Tree Reduction. Lecture Notes in Computer Science, 661–670. doi:10.1007/978-3-642-31464-3_67
PublisherSpringer Berlin Heidelberg
Conference/Event name9th International Conference on Parallel Processing and Applied Mathematics, PPAM 2011