计算机科学 ›› 2013, Vol. 40 ›› Issue (9): 21-24.

• 综述 • 上一篇    下一篇

互连网络的新模型:多部群论模型

师海忠   

  1. 西北师范大学数学与统计学院 兰州730070
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文受甘肃省自然科学基金(ZS991-A25-017-G)资助

New Model for Interconnection Networks:Multipartite Group-theoretic Model

SHI Hai-zhong   

  • Online:2018-11-16 Published:2018-11-16

摘要: 互连网络是超级计算机的重要组成部分。互连网络在很大程度上决定着超级计算机的性能。在1989年,S.B.Akers等提出了互连网络的群论模型,据此模型设计出了星网络、冒泡排序网络等一大批网络。尤其是星网络具有很多很好的性能,被认为是超立方体的替代品。但它们都有一个弱点:网络规模(结点数)为n!。即随着n的增大,n!增速太快,使得据此网络结构设计出的超级计算机升级较为困难,即扩展性较差。在群论模型的基础上提出了互连网络的多部群论模型,进而,据此模型设计出(n,k)-多部星网络、(n,k)-多部冒泡排序网络等多种网络。并证明星网络是(n,1)-多部星网络,而且(n,k)-多部星网络做到了规模(结点数)增大且增幅固定、直径增大缓慢、结点度不变,即有很好的可扩展性,其它(n,k)-多部网络也有类似的性能。

关键词: 互连网络,星网络,超立方体,(n,k)-多部Cayley图,(n,k)-多部星网络 中图法分类号TP393文献标识码A

Abstract: An interconnection network is an important partite of a supercomputer.In 1989,S.B.Akers et al,proposed a group-theoretic model for interconnection networks and designed many interconnection networks,such as,star network,bubble sort network,etc.In particularly,star networks own many better performances than the popular n-cubes.However,they have a weakness:the size of all above networks is n!,that is,n! is very speedly increasing with adding of n.This results in that the scalability of supercomputers built by the interconnection networks is very difficult.That is,the scalability of the supercomputer isn’t good.We proposed a multipartite group-theoretic model based on the the group-theoretic model.By this model,we designed many interconnection networks,such as,(n,k)-multipartite star networks,(n,k)-bubble sort networks,etc.Furthermore,we showed star network is(n,1)-multipartite star network and(n,k)-multipartite star networks own following better performances:the size of the network increases with fixed increment,its diameter increases slowly,its dgree is fixed.Other(n,k)-multipartite networks designed here own also the performances.

Key words: Interconnection network,Star network,n-cube,(n,k)-multipartite cayley graph,(n,k)-multipartite star network

[1] Akers S B,Krishnamurthy B.A group-theoretic model for interconnection networks[J].IEEE Transactions on computers,1989,38(4):555-565
[2] Bondy J A,Murty U S R.Graph Theory with Applications[M].London: Macmillian Press,1976
[3] 徐俊明.组合网络理论[M].北京:科学出版社,2007
[4] 高随祥.图论与网络流理论[M].北京:高等教育出版社,2009
[5] 王鼎兴,陈国良.互连网络结构分析[M].北京:科学出版社,1990
[6] Huang Kai.高等计算机系统结构[M].王鼎兴,等译.北京:清华大学出版社,南宁:广西科学技术出版社,1992
[7] Du D Z,Hsu D F,et al.Combinatorial Network Theory[M].Kluwer Academic Publishers,1996:65-105
[8] 师海忠.互连网络的代数环模型[D].北京:中国科学院应用数学研究所,1998
[9] Lakshmivarahan S,Jwo J S,Dhall S.Symmetric in interconnection networks based on Cayley graph of permutation groups:A survey[J].Parallel Computing,1993,19(4):361-407
[10] 师海忠,牛攀峰,马继勇,等.互连网络的向量图模型[J].运筹学学报,2011,15(3):115-123
[11] 师海忠,路建波.关于互连网络的几个猜想[J].计算机工程与应用,2008,44(31):112-115
[12] 师海忠,马继勇,牛攀峰,等.关于修正冒泡排序网络的一簇猜想[J].计算机科学,2011,2011,38(10A):265-267
[13] 师海忠,王国亮,马继勇,等.完全对换网络的一簇猜想[J].计算机科学,2012,39(6A):404-407
[14] 路建波,师海忠,牛攀峰.Star网络S6的Hamilton圈分解[J].工程数学学报,2011,28(1):565-568
[15] Walker D,Latifi S.Improving bounds on link failure tolerance of the star graph[J].Information Sciences,2010,180(13):2571-2575
[16] Wan Min,Zhang Zhao.Akind of condition vertex connectivity of star graphs[J].Applied Mathematics Letters,2009,22(2):264-267
[17] Wang Jian,Xu Xi-rong,Zhu De-jun,et al.On the bounds of feedback numbers of(n,k)-star graphs[J].Information Processing Letters,2012,2(12):473-478
[18] Tsai Ping-ying,Fu Jung-sheng,Chen Gen-huey.Fault-free lon-gest paths in star networks with conditional link faults[J]. Theo-retical Computer Science,2009,410(8-10):766-775
[19] Li T-K,Tan J J M,Hsu L-H.Hyper Hamiltonian laceability on edge fault star graph[J].Information Sciences,2004,165(1/2):59-71
[20] Rouskov Y,Latifi S,Srimani P K.Conditional fault diameter of star graph networks[J].Journal of Parallel and Distributed computing,1996,33(1):91-97
[21] Biggs N.Algebraic Graph Theory[M].MA:Cambridge University Press,1993
[22] 张禾瑞.近世代数基础[M].北京:高等教育出版社,1978
[23] Chou Z-T,Hsu C-C,Shen Jang-ping.Bubblesort star graphs:A New Interconnection Networks[C]∥Proceeding of the 1996International Conference on Parallel and Distributed Systems.1996
[24] Cheng E,Liptak L.Fault resiliency of Cayley graphs generated by transposition[J].International Journal of Foundations of Computer Science,2007,18(5):1005-1022

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!