高级检索

    三对角线性方程组的分布式并行算法

    A PARALLEL ALGORITHM FOR TRIDIAGONAL LINEAR EQUATIONS FOR DISTRIBUTED MEMORY SYSTEMS

    • 摘要: 文中回顾了Michielse&Vorst算法,分析了影响M&V算法并行效率的主要因素,根据分而治之思想提出一种求解三对角方程组的并行算法,新算法通信建立次数为M&V算法的50%,数据传输量为其33%,最后在工作站网络环境下实现了新算法,就并行效率与M&V算法进行了比较,结果表明在由6台工作站组成的网络中新算法性能提高可达到40%.

       

      Abstract: The method given by Michielse and Vorst is reviewed in the paper.The major factors are analyzed,which affect the efficiency of the M & V method.Then a new method for the solution of tridiagonal systems is given based on the divide and conquer computation model.The communication number of the method is half that of the M & V method,and the total data transmissions of the method is reduced to 33% that of the M & V method.The method is implemented on 6 nodes workstation clusters.The results show that compared with the M & V method,the improvement of the new method is up to 40%.

       

    /

    返回文章
    返回