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

一种无缓存光互连网络中的结点饿死问题及其解决
引用本文:徐炜遐,齐星云,窦强,冯权友. 一种无缓存光互连网络中的结点饿死问题及其解决[J]. 计算机工程与科学, 2011, 33(4): 45. DOI: 10.3969.j.issn.1007-130X.2011.04.009
作者姓名:徐炜遐  齐星云  窦强  冯权友
作者单位:国防科学技术大学计算机学院,湖南,长沙,410073
摘    要:本文针对一种无缓存的高性能计算机光互连网络BOIN中存在的结点饿死问题,提出了两种不同的解决方法——尽量回避的X优先路由算法和允许丢弃的X优先路由算法。这两种路由算法利用了报文在向X方向发送时其Y方向链路空闲的特点,使得发生冲突的报文可以通过空闲的链路顺利转发。模拟实验结果表明,采用这两种路由算法,能够很好地解决报文在发送时的饿死现象。

关 键 词:高性能计算机系统  光互连技术  冲突  结点饿死  路由

A Solution to the Node Starvation Problem in a Bufferless Optical Interconnection Network
X Wei-xia,QI Xing-yun,DOU Qiang,FENG Quan-you. A Solution to the Node Starvation Problem in a Bufferless Optical Interconnection Network[J]. Computer Engineering & Science, 2011, 33(4): 45. DOI: 10.3969.j.issn.1007-130X.2011.04.009
Authors:X Wei-xia  QI Xing-yun  DOU Qiang  FENG Quan-you
Affiliation:X(U) Wei-xia,QI Xing-yun,DOU Qiang,FENG Quan-you
Abstract:Aiming at the node starvation problem in BOIN(Bufferless Optical Interconnection Network),we put forward two routing algorithms,one is avoiding collision to the best,and the other is allowing packet discarding.Based on the fact that the links on the Y direction are idle when packets are being sent to the X direction,the two solutions can send packets out via the idle links when collision occurs.The simulation results show that the two routing algorithms can solve the starvation problem well in the BOIN network.
Keywords:high performance computer system  optical interconnection technology  collision  node starvation  routing
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机工程与科学》浏览原始摘要信息
点击此处可从《计算机工程与科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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