全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
电子学报  2013 

Torus网络中基于中心距离的完全自适应路由算法

DOI: 10.3969/j.issn.0372-2112.2013.11.001, PP. 2113-2119

Keywords: Torus网络,路由算法,虚通道,自适应路由

Full-Text   Cite this paper   Add to My Lib

Abstract:

Torus网络凭借其优越的结构特性,引起了工业界和学术界的广泛关注.高效、无死锁的路由算法设计是互连网络研究的一个重要方面.针对Torus网络实现自适应路由所需虚通道数目多的缺点,提出了自适应路由算法Gear,该算法基于中心距离的方法来限制虚通道的使用,在虚切通交换下仅需两条虚通道即可为Torus网络提供无死锁自适应路由.通过仿真对所提算法的有效性进行了验证,结果表明,在同等情况下算法Gear的性能较经典的维序路由和Duato协议具有非常明显的优势.

References

[1]  Duato Jose,Yalamanchili Sudhakar,et al.Interconnection Networks:An Engineering Approach[M].San Francisco,CA:Morgan Kaufmann,1997.1-204.
[2]  Adiga N R,Blumrich M A,et al.Blue gene/l torus interconnection network[J].IBM Journal of Research and Development,2005,49(2):265-276.
[3]  Chen Jun,Xu Du,et al.A positive-first and negative-first fault-tolerant routing schemes for concave and convex faults.International Conference on Future Computer and Communication.Wuhan:IEEE Computer Society,2010.53-58.
[4]  Dally W J,Seitz G L,Deadlock-free message routing in multiprocessor interconnection networks[J].IEEE Transaction on Computers,1987,36(5):547-553.
[5]  Chien A,Kim J H.Planar-adaptive routing:low-cost adaptive networks for multiprocessors[J].Journal of The ACM,1995,42(1):91-123.
[6]  顾华玺,刘增基,等.Torus网络中分布式自适应路由算法[J].西安电子科技大学学报(自然科学版),2006,33(3):352-358. Gu Huaxi,Liu Zengji,et al.Distribute adaptive routing in torus networks[J].Journal of Xidian University (Science),2006,33(3):352-358.(in Chinese)
[7]  Duato Jose.A new theory of deadlock-free adaptive routing in wormhole networks[J].IEEE Transaction on Parallel and Distributed Systems,1993,4(12):1320-1331.
[8]  Dally W J.Virtual-channel flow control[J].IEEE Transaction on Parallel and Distributed Systems,1992,3(3):194-205.
[9]  Schwiebert L,Jayashimha D N.A necessary and sufficient condition for deadlock-free wormhole routing[J].Journal of Parallel and Distributed Computing,1996,32(1):103-117.
[10]  Linder D H,Harden J C.An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes[J].IEEE Transaction on Computers,1991,40(1):2-12.
[11]  Xiang Dong.Deadlock-free adaptive routing in meshes with fault-tolerance ability using channel overlapping[J].IEEE Transaction on Dependable and Secure Computing,2011,8(1):74-88.
[12]  Xu Yi,Zhao Bo,et al.Simple virtual channel allocation for high throughput and high frequency on-chip routers.16th International Symposium on High Performance Computer Architecture.Bangalore,India:IEEE Computer Society,2010.1-11.
[13]  Matsutani H,Koibuchi M,et al.Fat H-Tree:A cost-efficient tree-based on chip network[J].IEEE Transaction on Parallel and Distributed Systems,2009,20(8):1126-1141.
[14]  Verbeek Freek,Schialtz Julien.A comment on a necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks[J].IEEE Transaction on Parallel Distribute System,2011,22(10):1775-1776.
[15]  Verbeek Freek,Schialtz Julien.On necessary and sufficient conditions for deadlock-free routing in wormhole networks[J].IEEE Transaction on Parallel Distribute System,2011,22(12):2022-2032.
[16]  Dally W J,Towles B.Principles and Practices of Interconnection Networks[M].San Francisco CA:Morgan Kaufmann,2004.112-321.
[17]  Luo Wei,Xiang Dong.An efficient adaptive deadlock-free routing algorithm for torus networks[J].IEEE Transaction on Parallel and Distributed Systems,2012,23(5):800-808.
[18]  Glass C J,Ni L.The turn model for adaptive routing[J].Journal of the ACM,1994,41(5):874-902.
[19]  Chiu Geming.The odd-even turn model for adaptive routing[J].IEEE Transaction Parallel and Distributed Systems,2000,11(7):729-738.
[20]  Fu Binzhang,Han Yinhe,et al.An abacus turn model for time/space-efficient reconfigurable routing[A].38th International Symposium on Computer Architecture[C].San Jose,CA:ACM Sigarch Computer Architecture News,2011.259-270.
[21]  Xiang Dong,Wang Qi,et al.Deadlock-free fully adaptive routing in tori based on a new virtual network partitioning[A].37th International Conference on Parallel Processing[C].Portland,Oregon:IEEE Computer Society,2008.612-619.
[22]  Ascia G,Catania V,et al.Implementation and analysis of a new selection strategy for adaptive routing in networks-on-chip[J].IEEE Transaction on Computers,2008,57(6):809-820.
[23]  Ramanujam R.S,Lin B.Weighted random routing on torus networks[J].IEEE Computer Architecture Letters,2009,8(1):1-4.
[24]  Xiang Dong,Zhang Yueli,et al.Practical deadlock-free fault-tolerant routing in meshes based on the planar network fault model[J].IEEE Transaction on Computers,2009,58(5):620-633.
[25]  杨盛光,李丽,等.面向能耗和延时的NoC映射方法[J].电子学报,2008,36(5):937-942. Yang Shengguang,Li Li,et al.An energy and delay-aware mapping method of NoC.Acta Electronica Sinica,2008,36(5):937-942.(in Chinese)
[26]  赵宏智.2D Mesh片上网络中交换机服务性能影响的研究及其拓扑改进[J].电子学报,2009,37(2):294-298. Zhao Hongzhi.Study of the impact of switch service performance on 2d mesh network on chip and its improved topology[J].Acta Electronica Sinica,2009,37(2):294-298.(in Chinese)
[27]  马立伟,孙义和.片上网络拓朴优化:在离散平面上布局与布线[J].电子学报,2007,35(5):906-911. Ma Liwei,Sun Yihe.Network-on-Chip topology optimizations:floor-plan and routing on discrete plane[J].Acta Electronica Sinica,2007,35(5):906-911.(in Chinese)
[28]  Matsutani H,Koibuchi M,et al.Prediction router:A low-latency on-chip router architecture with multiple predictors[J].IEEE Transaction on Computers,2011,60(6):783-799.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133