###
:2019,28(9):246-250
本文二维码信息
码上扫一扫!
基于分治法求解对称三对角矩阵特征问题的混合并行实现
(1.中国科学院 计算机网络信息中心, 北京 100190;2.中国科学院大学, 北京 100049)
Hybrid Parallel Algorithm Using MPI/Cilk for Symmetric Tridiagonal Eigenproblems
(1.Computer Network Information Center, Chinese Academy of Sciences, Beijing 100190, China;2.University of Chinese Academy of Sciences, Beijing 100049, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 52次   下载 62
投稿时间:2019-03-05    修订日期:2019-04-02
中文摘要: 基于对称三对角矩阵特征求解的分而治之方法,提出了一种改进的使用MPI/Cilk模型求解的混合并行实现,结合节点间数据并行和节点内多任务并行,实现了对分治算法中分治阶段和合并阶段的多任务划分和动态调度.节点内利用Cilk任务并行模型解决了线程级并行的数据依赖和饥饿等待等问题,提高了并行性;节点间通过改进合并过程中的通信流程,使组内进程间只进行互补的数据交换,降低了通信开销.数值实验体现了该混合并行算法在计算效率和扩展性方面的优势.
中文关键词: 并行计算  对称特征问题  分治算法  Cilk
Abstract:Divide and conquer algorithm is widely used for tridiagonal matrix eigenproblems while computing efficiency and storage limitation are always bottlenecks for large scale problems. In this study, the proposed eigenproblem algorithm based on hybrid parallel paradigm with MPI/Cilk optimizes the divide and conquer algorithm both at data and task levels. The introduced task-based parallelization mechanism inside computing nodes solves the problem in data dependence and thread starvation by directed acyclic graph model. By coarse-grained partition of tasks the overhead of data communication among MPI nodes is also optimized, which helps to improve load balance. The numerical test is carried out and the result is compared with the pure MPI and MPI/openMP parallel algorithm, which shows the performance and efficiency of the algorithm.
文章编号:     中图分类号:    文献标志码:
基金项目:国家重点研发计划(2017YFB0202202,2016YFB0201302);中国科学院“十三五”信息化建设专项(XXH13506-405)
引用文本:
朱京乔,赵永华.基于分治法求解对称三对角矩阵特征问题的混合并行实现.计算机系统应用,2019,28(9):246-250
ZHU Jing-Qiao,ZHAO Yong-Hua.Hybrid Parallel Algorithm Using MPI/Cilk for Symmetric Tridiagonal Eigenproblems.COMPUTER SYSTEMS APPLICATIONS,2019,28(9):246-250

用微信扫一扫

用微信扫一扫