期刊文献+

基于交叉立方体环连接的Petersen图互联网络研究

Research on the Petersen Graph Interconnection Network Based on the Cross Cube Ring
在线阅读 下载PDF
导出
摘要 利用环的简单扩展性以及Petersen图的短直径与交叉立方体节点的高可连接性,提出了一种新型互联网络RCP(n),并对其性质进行了一些研究,证明了RCP(n)网络不但具有正则性以及良好的可扩展性,同时还具有比Qn,HP(n),RHP(n)网络更短的直径和更小的构造开销。 On the basis of the simple topology of ring and the high connectivity of the short diameter of Petersen graph and the nodes of the cross cube, this paper puts forward a novel interconnection network, RCP (n) (Ringed Crossed cube Connected Petersen), and researches on its characteristics, which proves that RCP (n) possesses not only the regularity and good extensibility, but also the shorter diameter and smaller construction costs than those previously well-known interconnection networks such as Qn HP(n) and RHP(n).
作者 郭璞
出处 《科技情报开发与经济》 2006年第3期157-158,共2页 Sci-Tech Information Development & Economy
关键词 PETERSEN图 交叉立方体 互联网络 ring Petersen graph crossed cube interconnection network
  • 相关文献

参考文献8

  • 1LaForge L E,Fadali M S.What design ers of bus and network architectures should know about hypercubes [J].IEEE Transactions on Computers,2003,52(4):525-544.
  • 2Saxena P C,Gupta S,Rai J.A delay optimal coterie on the kdimensional folded Petersen graph [J].Journ al of Parallel Dis-tributed Computing,2003,63:1 026-1 035.
  • 3刘方爱,刘志勇,乔香珍.光RP(k)网络上Hypercube通信模式的波长指派算法[J].软件学报,2003,14(3):575-581. 被引量:15
  • 4Das S K,Ban erjee A K.Hyper Petersen network:Yet an other hypercube-like topology [G]// Proceedings of the 4th Symposium on the Frontiers of Massively Parallel Computation.Mclean Virginia,1992:270-278.
  • 5刘方爱,乔香珍,刘志勇.一种实用的互联网络拓扑结构RP(k)及路由算法[J].中国科学(E辑),2002,32(3):380-385. 被引量:19
  • 6Hibers P A J,Koopman M R J,van de Snepscheut J L A.The twisted cube[G]//Bakker J W.Parallel Architectures and Languages Europe,Lecture Notes in Computer Science.Berlin,New York:Springer-Verlag,1987:152-159.
  • 7王雷,林亚平.基于超立方体环连接的Petersen图互联网络研究[J].计算机学报,2005,28(3):409-413. 被引量:20
  • 8Kulasinghe P,Bettayeb S.Embedding binary trees into crossed cubes [J].IEEE Trans on Computers,1995,44(7):923-929.

二级参考文献19

  • 1[1]Ortiz Z, Rouskas GN, Perros HG. Maximizing multicast throughput in WDM networks with tuning latencies using the virtual receiver concept. European Transactions on Telecommunications, 2000,11(1):63~72.
  • 2[2]Qiao CM, Mei YS. Off-Line permutation embedding and scheduling in multiplexed optical networks with regular topologies. IEEE/ACM Transactions on Networking, 1999,7(2):241~250.
  • 3[3]Yuan X, Melhem R. Optimal routing and channel assignments for hypercube communication on optical mesh-like processor arrays. In: Johnsson SL, ed. Proceedings of the 5th International Conference on Massively Parallel Processing Using Optical Interconnection. Las Vegas, NV: IEEE Press, 1998. 110~118.
  • 4[4]Yuan X, Melhem R, Gupta R. Distributed path reservation algorithm for multiplexed all-optical interconnection networks. IEEE Transactions on Computer, 1999,48(12):1355~1363.
  • 5[5]Yuan X, Melhem R, Gupa R. Performance of multi-hop communications using logical topologies on optical Torus networks. Journal of Parallel and Distributed Computing, 2001,61(6):748~766.
  • 6[6]Liu FA, Liu ZY, Qiao XZ. A practical interconnection network RP(k) and its routing algorithms. Science in China (Series F), 2001,44(6):461~473.
  • 7[7]Shen XJ, Liang WF, Hu Q. On embedding between 2D meshes of the same size. IEEE Transactions on Computer, 1997,46(8): 880~889.
  • 8LaForge L.E., Korver K.F., Fadali M.S.. What designers of bus and network architectures should know about hypercubes. IEEE Transactions on Computers, 2003, 52(4): 525~544.
  • 9Hibers P.A.J., Koopman M.R.J., van de Snepscheut J.L.A.. The twisted cube. In: Bakker J.W. et al. eds..Parallel Architectures and Languages Europe, Lecture Notes in Computer Science. Berlin/New York: Springer-Verlag, 1987, 152~159.
  • 10Chang Chien-Ping, Wang Jyh-Nan , Hsu Lih-Hsing. Topological properties of twisted cube. Information Sciences, 1999, 113 (1~2): 147~167.

共引文献40

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部