Parallel Cholesky factorization on a shared-memory multiprocessor. Final report, 1 October 1986-30 September 1987
Parallel Cholesky factorization on a shared-memory multiprocessor. Final report, 1 October 1986-30 September 1987
复制标题
DOI：
10.1016/0024-3795(86)90167-9
复制
发表时间：
1986-05
期刊：
影响因子：
--
通讯作者：
Alan George;Michael T. Heath;Joseph W. H. Liu
中科院分区：
文献类型：
--
作者：
Alan George;Michael T. Heath;Joseph W. H. Liu
开发了一种并行算法，用于共享内存多处理器上的 Cholesky 分解。该算法基于任务池的自我调度。根据优先级关系、工作配置文件和处理器利用率来分析基本消除算法的几个变体中的子任务的潜在并发性。该分析得到了模拟结果的支持。最有前途的变体，我们称之为column-Cholesky，是为Denelcor HEP 多处理器识别和实现的。给出了该机器的实验结果。
A parallel algorithm is developed for Cholesky factorization on a shared-memory multiprocessor. The algorithm is based on self-scheduling of a pool of tasks. The subtasks in several variants of the basic elimination algorithm are analyzed for potential concurrency in terms of precedence relations, work profiles, and processor utilization. This analysis is supported by simulation results. The most promising variant, which we call column-Cholesky, is identified and implemented for the Denelcor HEP multiprocessor. Experimental results are given for this machine.