QQ客服 官方微博 反馈留言

	基于区域分解和MPI的线性带状方程组归并迭代解法器
	刘朝辉 ; 舒继武 ; 郑纬民 ; LIU Zhaohui ; SHU Jiwu ; ZHENG Weimin
	2010-06-09 ; 2010-06-09
关键词	并行解法器 区域分解 MPI 迭代 进程通信 parallel solver domain decomposition message passing interface(MPI) iteration process communication TP301
其他题名	Iteration-merged solver for linear banded matrices based on domain decomposition and MPI
中文摘要	线性带状方程组并行解法器往往基于两层迭代的区域分解方法,采用M P I(m essage pass ing in terface)实现,因此导致的总迭代次数太多或者进程通信开销太大都会使解法器效率低下。该文通过研究减少迭代次数和降低进程通信开销的方法,设计了一种适合区域分解和M P I系统的高效的归并迭代并行解法器。这种解法器通过引入全局加速收敛算法,把两层迭代归并为一层迭代,有效减少了迭代求解的总次数,并且采用分块并行技术降低M P I系统上加速收敛算法的进程通信开销。实验证明归并迭代并行解法器能够保证和串行解法器大致相当的总迭代次数,分块并行加速收敛技术能够降低接近1/2的全局进程通信时间。; Parallel solvers for linear banded systems are often based on domain decomposition methods with two levels of iterations implemented with a message passing interface(MPI).However,excessive iterations,as well as excessive process communications, result in low parallel efficiency.This paper presents an efficient iterationmerged solver suitable for domain decomposition and MPI systems that minimizes the iterations and the process communications.A global acceleration algorithm merged two levels of iterations into one level to reduce the total number of iterations with a block-parallel technique to minimize the process communications on MPI systems caused by the global acceleration.Tests demonstrate that the parallel solver have the same number of iterations with the block-parallel technique reducing the process communication time for the global acceleration by half.; 清华大学“九八五”基础研究基金项目(JC2002027)
语种	中文 ; 中文
内容类型	期刊论文
源URL	[http://hdl.handle.net/123456789/55622]
专题	清华大学
推荐引用方式 GB/T 7714	刘朝辉,舒继武,郑纬民,等. 基于区域分解和MPI的线性带状方程组归并迭代解法器[J],2010, 2010.
APA	刘朝辉,舒继武,郑纬民,LIU Zhaohui,SHU Jiwu,&ZHENG Weimin.(2010).基于区域分解和MPI的线性带状方程组归并迭代解法器..
MLA	刘朝辉,et al."基于区域分解和MPI的线性带状方程组归并迭代解法器".(2010).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。