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

基于Hamming距离的超立方体网络的寻径算法
引用本文:陈国龙,张德运,王晓东. 基于Hamming距离的超立方体网络的寻径算法[J]. 小型微型计算机系统, 1999, 20(6): 422-424
作者姓名:陈国龙  张德运  王晓东
作者单位:1. 西安交通大学,西安,710049
2. 福州大学计算机系,福州,350002
摘    要:本文利用Hamming距离概念,提出两种基于Hamming距离的确定性寻径算法-E1-cuberouting和E2-cube-routing,分析这两种算法的特点,为了克服确定性寻径算法易出现通道拥挤现象,本文综合上述两种算法,提出一种自适应寻径算法-E3-cube routhing。

关 键 词:Hamming距离 寻径算法 并行计算机 超立方体网络

THE ROUTING ALGORITHM OF N-CUBE NETWORK BASED ON HAMMING DISTANCE
CHEN Guolong,ZHANG Deyun,WANG Xiaodong. THE ROUTING ALGORITHM OF N-CUBE NETWORK BASED ON HAMMING DISTANCE[J]. Mini-micro Systems, 1999, 20(6): 422-424
Authors:CHEN Guolong  ZHANG Deyun  WANG Xiaodong
Affiliation:CHEN Guolong ZHANG Deyun WANG Xiaodong (Xi'an Jaotong University Xi'an 710049) (Fuzhou University Fuzhou 350002)
Abstract:In this thesis, we provide the cocept of Hamming distance, present two deterministic routing algorithms-E1 cube routing and E2 cube routing, and analyses their properties. In order to climinate the block of passage produced easily by deterministic routing algorithm, the paper presents an adaptive routing algorithm-E3 cube routing, symthesized the above algorithms.
Keywords:Hamming distance Deterministic routing algorithm Adaptive algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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