期刊文献+

几类新的笛卡尔乘积互连网络 被引量:11

Some New Cartesian Product Interconnection Networks
下载PDF
导出
摘要 Star网络、Pancake网络、Bubble sort网络、修正Bubble sort网络(又称圈图)、轮图等都既是Cayley图又是重要的互连网络。利用图的笛卡尔乘积方法构建了几类新的笛卡尔乘积互连网络:环网、循环移数网络、ILLIAC网络、超立方体分别与Star网络、Pancake网络、Bubble sort网络、修正Bubble sort网络、轮图的笛卡尔乘积网络;这些网络的某些性能指标(例如,直径等)比Star网络或超立方体更好。 Star network, pancake network, bubble sort network, modified bubble sort network, wheel network, etc, are not only Cayley graphs but also important interconnection networks. In this paper, we develop many new networks, called Cartesian product networks of the ring network, the barrel/shifter network, the ILLIAC networks, the n-cube and the Star network, the pancake network, the bubble sort network, the modified bubble sort net works, the wheel net-work, respectively. These networks are shown to have better performance, as measured by some parameters(such as, diameter,etc. )than the n-cubes or the Star networks.
作者 师海忠
出处 《计算机科学》 CSCD 北大核心 2013年第06A期265-270,306,共7页 Computer Science
关键词 CAYLEY图 互连网络 笛卡尔乘积网络 超立方体 Star网络 Cayley graph, Interconnection network,Cartesian product interconnection network,n-cube,Star network
  • 相关文献

参考文献14

  • 1Akers S B, Harel D, Krishnamurphy B. The star graph: An at- tractive alternative to the n-cube[C]//Proceedings of Interna- tional Conference on Parallel Processing. 1987:393-400.
  • 2Akers S B,Krishnamurthy B. A group-theoretic Model for sym- metric interconnection networks [J]. IEEE Transactions on Computers, 1989,38(4) : 555-565.
  • 3Lakshmivaraha S, Two J-S, Dhall S K. Symmetry in interconnec- tion networks based on Cayley graphs of permutation groups., a survey[J]. Parallel computing, 1993,19(4) : 361-407.
  • 4Andre F, Verjus J P. Hypercubes and Distributed computer [M]. Amsterdam, New York, Oxford: North-Halland, 1989.
  • 5Biggs N. Algebraic Graph Theory [M]. Cambridge: Cambridge University Press, 1993.
  • 6Bondy J A, Murty U S R. Graph Theory with Applications[M]. London and Basingstoke: MacMillan Press LTD, 1976.
  • 7Harary F. Recent results and unsolved problems on hypercube theory[M]. Alavi Y , Chartrand G, Oellermann O R, et al. , eds. Graph Theory, Combinatorics, Applications, John Wiley sons, 1991 : 621-632.
  • 8Barnes G H,Brown R M,Kato M,et al. The ILLIAN computer [J]. IEEE Transactions on Computers, 1968,17 : 746-757.
  • 9Kai Hwang.高等计算机系统结构:并行性、可扩展性、可编程性[M].王鼎兴,等译.北京:清华大学出版社,南宁:广西科学技术出版社,1995.
  • 10Witte D, Gallian J A. A survey Hamilton cycles in Cayley graphs [J]. Discrete Mathematics 1984,51 : 293-304.

二级参考文献11

  • 1Akers S B,Krishnamurthy B.A group-theoretic model for symmetric interconnection networks[J].IEEE Trans Computers, 1989,38 (4) : 555-565.
  • 2师海忠.关于Star-网络的一个猜想.兰州大学学报:自然科学版,2007,43:199-200.
  • 3Bondy J A,Murty U S R.Graph theory with applications[M].New York : American Elserer, 1976.
  • 4Bigs N L.Algebraic graph theory[M].Cambridge:Cambridge University Press, 1993.
  • 5Bagherzadeh N,Dowd M,Nassif N.Embedding an arbitrary tree into the star graph[J].IEEE Trans Comput,1996,45:475-481.
  • 6Day K,Tripathi A.A comparative study of topological properties of hypercubes and star graphs[J].IEEE Trans Parallel Distrib Syst, 1994,5:31-38.
  • 7Jwo J S,Lakshmivarahan S,Dhall K S.Embedding of cycles and grids in star graphs[J].J Circuits Syst Comput, 1991,1(1 ):43-74.
  • 8Hsieh S Y,Chen G H,Ho C W.longest fault-free paths in star graphs with edge fauhs[J].IEEE Trans Comput, 2001,50(9) :960- 971.
  • 9Li T K.Cycle embedding in star graphs with edg fauhs[J].Appl Math Comput,2005,167:891-900.
  • 10Xu M,Hu X D,Zhu Q.Edge-bipancyclicity of star graphs under edge-fault tolerant[J].Appl Math Comput, 2006,183 : 972-979.

共引文献19

同被引文献21

引证文献11

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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