| 王光荣,顾乃杰.在消息传递并行机上的高效的最小生成树算法.软件学报,2000,11(7):889-898 |
| 在消息传递并行机上的高效的最小生成树算法 |
| An Efficient Parallel Minimum Spanning Tree Algorithm on Message Passing Parallel Machine |
| 投稿时间：1999-01-21 修订日期：1999-07-20 |
| DOI： |
| 中文关键词: MPP (message passing parallel), MST (minimum spanning tree)，并行算法，通信，非关联图. |
| 英文关键词:MPP (message passing parallel), MST (minimum spanning tree), parallel algorithm, communication, disjoint set. |
| 基金项目:This research is supported by the Ph.D.Foundation of State Education Commission of China(国家教育部博士点基金No.9703825) |
|
| 摘要点击次数: 3286 |
| 全文下载次数: 3265 |
| 中文摘要: |
| 基于传统的Borǔ vka串行最小生成树算法，提出了一个在消息传递并行机上的高效的最小生成树算法.并且采用3种方法来提高该算法的效率，即通过两趟合并及打包收缩的方法来减少通信开销，通过平衡数据分布的办法使各个处理器的计算量平衡.该算法的计算和通信复杂度分别为O(n2/p)和O((tsp+twn)n/p).在曙光-1000并行机上运行的实际效果是，对于有10 000个顶点的稀疏图，通过16个节点的运行加速比是12. |
| 英文摘要: |
| An efficient parallel minimum spanning tree is proposed based on the classical Borüvka's algorithm on message passing parallel machine. Three methods were used to improve its efficiency, including two-phase union and packaged contraction for reducing communication costs, and the balanced data distribution for computation balance in each processor. The computation and communication costs of the algorithm are O(n2/p) and O((tsp+twn)n/p). On Dawning-1000 parallel machine, it gets a speedup of 12 on 16 processors with a sparse graph of 10 000 vertices. |
|
HTML 下载PDF全文 查看/发表评论 下载PDF阅读器 |
