LogP is becoming a practical parallel computation model that meets the demanding of parallel computersand parallel algorithms. So it is important to re-design parallel algorithms on the LogP model. This paper studies ...LogP is becoming a practical parallel computation model that meets the demanding of parallel computersand parallel algorithms. So it is important to re-design parallel algorithms on the LogP model. This paper studies theparallel algorithm of computing converse matrix on the simplified LogP model, and gets the simulating results.展开更多
本文是把传统的大气、海洋问题中常用的串行迭代法——Liebmann 方法(点迭代)和局地格林函数迭代法(局地点迭代),从算法上变成适合于 IBM—4381(P03)双 CPU 并行执行的并行算法,求解 Poisson 方程零边界值问题。实例计算试验表明:上述...本文是把传统的大气、海洋问题中常用的串行迭代法——Liebmann 方法(点迭代)和局地格林函数迭代法(局地点迭代),从算法上变成适合于 IBM—4381(P03)双 CPU 并行执行的并行算法,求解 Poisson 方程零边界值问题。实例计算试验表明:上述两种方法的并行算法的效率是同一计算问题的串行算法的1.8倍和1.9倍;若把区域扩大,局地格林函数并行迭代效率可达2.8倍,大大超过 IBM 公司所称 P03型机是 P01型机的1.7倍的效率;本文还指出 IBM—4381(P03)型计算机的两个 CPU 在执行并行运算时,可以共享数据组。展开更多
文摘LogP is becoming a practical parallel computation model that meets the demanding of parallel computersand parallel algorithms. So it is important to re-design parallel algorithms on the LogP model. This paper studies theparallel algorithm of computing converse matrix on the simplified LogP model, and gets the simulating results.
文摘本文是把传统的大气、海洋问题中常用的串行迭代法——Liebmann 方法(点迭代)和局地格林函数迭代法(局地点迭代),从算法上变成适合于 IBM—4381(P03)双 CPU 并行执行的并行算法,求解 Poisson 方程零边界值问题。实例计算试验表明:上述两种方法的并行算法的效率是同一计算问题的串行算法的1.8倍和1.9倍;若把区域扩大,局地格林函数并行迭代效率可达2.8倍,大大超过 IBM 公司所称 P03型机是 P01型机的1.7倍的效率;本文还指出 IBM—4381(P03)型计算机的两个 CPU 在执行并行运算时,可以共享数据组。
