A Dynamic Scheduling Algorithm Based on GaBP
Based on Gaussian Belief Propagation (GaBP) algorithm for solving sparse symmetric linear equations, an iterative acceleration optimization method of G-aBP is studied.We explore the parallelism and load balancing features of this algorithm and present a multicore-based parallel GaBP algorithm with dynamic scheduling.The numerical results indicate that this algorithm can solve large scale sparse symmetric linear equations with high convergence and higher parallel efficiency.
parallelization GaBP algorithm dynamic scheduling sparse linear equations
Hanyuan Zheng Anping Song Lei Xu Zhixiang Liu Minchao Wang Wu Zhang
School of Computer Engineering and Science, Shanghai University,200072 Shanghai, China;School of Com School of Computer Engineering and Science, Shanghai University,200072 Shanghai, China
国际会议
上海
英文
183-189
2013-08-01(万方平台首次上网日期,不代表论文的发表时间)