$${{\fancyscript{H}}} $$H-LU factorization on many-core systems
$${{\fancyscript{H}}} $$H-LU factorization on many-core systems
复制标题
多核系统上的 $${{fancyscript{H}}} $$H-LU 分解
DOI：
10.1007/s00791-014-0226-7
复制
发表时间：
2013
影响因子：
--
通讯作者：
Ronald Kriemann
中科院分区：
文献类型：
--
作者：
Ronald Kriemann
A version of the $${{\fancyscript{H}}} $$H-LU factorization is introduced, based on the individual computational tasks occurring during the block-wise $${{\fancyscript{H}}} $$H-LU factorization. The dependencies between these tasks form a directed acylic graph, which is used for efficient scheduling on parallel systems. The algorithm is especially suited for many-core processors and shows a much improved parallel scaling behavior compared to previous $${{\fancyscript{H}}} $$H-LU factorization algorithms.
