首页 | 本学科首页   官方微博 | 高级检索  
     

基三分层网络中一种基于查表的确定路由算法
引用本文:乔保军,石峰,计卫星,刘滨.基三分层网络中一种基于查表的确定路由算法[J].计算机应用,2006,26(9):2162-2165.
作者姓名:乔保军  石峰  计卫星  刘滨
作者单位:1. 北京理工大学,计算机科学工程系,北京,100081;河南大学,数据与知识工程研究所,河南,开封,475001
2. 北京理工大学,计算机科学工程系,北京,100081
摘    要:路由算法对互连网络的通信性能和并行系统性能的发挥起着重要作用。针对基三分层互连网络,提出一种基于查表的使消息沿两节点间近似最短路径传递的分布式确定路由算法TDRA。该算法充分利用基三分层互连网络的层次特性,其路由表中仅保存各节点的同族节点和部分组的路由信息,路由表所占存储空间小,路由效率高。

关 键 词:并行计算  互连网络  分布式确定路由算法
文章编号:1001-9081(2006)09-2162-4
收稿时间:2006-03-27
修稿时间:2006-03-272006-06-27

Table-lookup determined routing algorithm for triple-based hierarchical interconnection network
QIAO Bao-jun,SHI Feng,JI Wei-xing,LIU Bin.Table-lookup determined routing algorithm for triple-based hierarchical interconnection network[J].journal of Computer Applications,2006,26(9):2162-2165.
Authors:QIAO Bao-jun  SHI Feng  JI Wei-xing  LIU Bin
Affiliation:1. Department of Computer Science and Engineering, Beijing Institute of Technology, Beijing 100081, China; 2. Institute of Data and Knowledge Engineering, Henan University, Kaifeng Henan 475001, China
Abstract:Efficient routing algorithm is very essential to the performance of the interconnection network and the whole parallel computing system.This paper presented TDRA(Table-lookup Deterministic Routing Algorithm) in triple-based hierarchical interconnection network,which always delivers the message along the approximately shortest path between any two nodes.Because the route table of any nodes only stores the route information for its cognation nodes and some special group,the cost of storage is very low and the route performance is high.Finally,the analysis based on the simulation of TDRA shows it is not only very simple and easy to implement,but also highly effective.
Keywords:parallel computing  intercormection network  distributed deterministic routing algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号