|
|||||
|
|
| HDRA:一种基于历史寻径信息的分布式路由算法 | |
| 引用本文： | 乔保军,毋琳,计卫星.HDRA:一种基于历史寻径信息的分布式路由算法[J].计算机应用与软件,2006,23(6):98-99,137. |
| 作者姓名： | 乔保军 毋琳 计卫星 |
| 作者单位： | 1. 北京理工大学计算机科学工程系,北京,100081;河南大学计算机与信息工程学院,河南,开封,475001 2. 河南大学计算机与信息工程学院,河南,开封,475001 3. 北京理工大学计算机科学工程系,北京,100081 |
| 摘 要： | 直接互连网络已成为构建大规模并行系统的主流网络互连体系结构，路由算法对互连网络的通信性能和并行系统性能的发挥起着重要作用。针对静态互连网络，提出一种新的基于路由表查找技术的分布式路由算法HDRA，该算法有效地利用历史寻径信息，加快路由寻径速度，提高网络传输性能，而且算法设计简单，易于硬件实现。 |
| 关 键 词： | 并行计算 互连网络 分布式路由算法 |
| 收稿时间： | 2005-07-15 |
| 修稿时间： | 2005-07-15 |
HDRA:A HISTORY-BASED DISTRIBUTED ROUTING ALGORITHM |
|
| Qiao Baojun,Wu Lin,Ji Weixing.HDRA:A HISTORY-BASED DISTRIBUTED ROUTING ALGORITHM[J].Computer Applications and Software,2006,23(6):98-99,137. | |
| Authors: | Qiao Baojun Wu Lin Ji Weixing |
| Affiliation: | Department of Computer Science and Engineering, Beijing Institate of Technology, Beijing 100081, China;College of Computer and Information Engineering, Henan University, Kaifeng Henan 475001, China |
| Abstract: | Direct interconnection networks have become a popular architecture for constructing massively parallel computers.An efficient routing algorithm is very essential to the performance of the interconnection network and the whole parallel computing system.This paper presents HDRA(history-based distributed routing algorithm) which decides the routing for message by looking up route table of one node's.The algorithm uses the history routing information,so the algorithm not only is very simple and easy to implement using hardware but also has high efficiency. |
| Keywords: | Parallel computing Interconnection network Distributed routing algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |