| 一种适合2D-Mesh互连网络的树状多播算法 |
| |
| 引用本文： | 过晓冰,伍卫国,刘敏,钱德沛,董小社.一种适合2D-Mesh互连网络的树状多播算法[J].小型微型计算机系统,2003,24(4):648-651. |
| |
| 作者姓名： | 过晓冰 伍卫国 刘敏 钱德沛 董小社 |
| |
| 作者单位： | 西安交通大学,计算机系,陕西,西安,710049 |
| |
| 基金项目： | 国家“863”计划基金项目(863-306-ZD11-01-8)资助. |
| |
| 摘 要： | 针对虫蚀寻径的2D－Mesh互连的多处理机网络，归纳了多播算法的要求，在分析比较路状多播和树状多播算法的基础上，提出一种结合两者优点的新型树状多播算法，该算法基于Hamilton寻径，即源节点到每一个目标节点的路径为最短路径，且具有无死锁的特性，同时，多播数据在源节点发送，途径节点转发所需计算的时间复杂度均为O（1），与多播目标节点集的大小和分布无关，数据模拟测试的结果表明，该算法的性能优越。
|
| 关 键 词： | 2D－Mesh互连网络 树状多播算法 多处理机系统 网格互连 虫蚀寻径 计算机网络 |
| 文章编号： | 1000-1220(2003)04-0648-04 |
Tree-based Multicast Algorithm for 2D-mesh Multiprocessor System |
| |
| GUO Xiao-bing,WU Wei-guo,LIU Min,QIAN De-pei,DONG Xiao-she.Tree-based Multicast Algorithm for 2D-mesh Multiprocessor System[J].Mini-micro Systems,2003,24(4):648-651. |
| |
| Authors: | GUO Xiao-bing WU Wei-guo LIU Min QIAN De-pei DONG Xiao-she |
| |
| Abstract: | This paper analyzes wormhole-routed 2D-mesh multiprocessor network, and presents an efficient algorithm that synthesizes path-based multicast algorithm and tree-based multicast algorithm. The algorithm bases on Hamilton-route, and the length between source node and each destination node is the shortest. The algorithm is deadlock-free. The time complexity of all nodes is O (1), which means that there is no relation between time and destination nodes set. This multicast algorithm is proved optimal by numerous data testing. |
| |
| Keywords: | multiprocessor system mesh-connected wormhole routing multicast |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
