Computer Science ›› 2020, Vol. 47 ›› Issue (6A): 299-304.doi: 10.11896/JsJkx.190700047

• Computer Network • Previous Articles     Next Articles

Model of Cartesian Product of Modulo p Residual Class Addition Group for Interconnection Networks

SHI Teng1 and SHI Hai-zhong2   

  1. 1 School of Electronic and Information Engineering,Lanzhou City University,Lanzhou 730070,China
    2 College of Mathematics and Statistics,Northwest Normal University,Lanzhou 730070,China
  • Published:2020-07-07
  • About author:SHI Teng, born in 2000.His main research interests include network science and language.
    SHI Hai-zhong, born in 1962, Ph.D, professor.His main research interests include interconnection network, graph semigroup, (V, R)-semigroup, undirec-ted graph language, digraph language, random graph language, (V, R)-language, network science and language.

Abstract: Many applications require high computational density of the system,the computational density here refers to the computational power of a system in a certain volume or area.This is why a large number of distributed computing such as grid computing and cloud computing cannot completely replace supercomputing.Supercomputers are also widely used in emerging fields.Academician Chen Zuoning pointed out that the United States is developing an exascale supercomputer with a new advanced architecture (probably not a classical one),and China is also actively developing its own exascale supercomputer.Interconnection network is an important part of supercomputer architecture.Academician Chen pointed out that interconnection network is deci-sive to the performance-price ratio of the system.In this paper,a Cartesian product of modulo p residual class addition groups model for interconnection networks was designed,which can be used to characterize well-known interconnection networks such as hypercube and folded hypercube.More importantly,many new interconnection networks have been designed using this model.These new interconnection networks have their own characteristics and greatly enrich the seed bank of interconnection networks.

Key words: Exascale supercomputer, Interconnection network, Hypercube, Folded hypercube, Modulo p residual class addition group, Cartesian product, Model

CLC Number: 

  • TP393
[1] SI H W,FENG L S.Semour Cray:The Father of Supercomputer.Journal of Dialectics of Nature,2018,40(7):127-133.
[2] CHEN Z N.Supercomputers Entering a New Era.Democracy & Science,2017,167(4):24-25.
[3] WANG D X,CHEN G L.Analysis of Interconnection Network Structure.BeiJing:Science Press,1990.
[4] XU J M.A First Course in Graph Theory.BeiJing:Science Press,2015.
[5] AKERS S B,KRISHNAMURTHY B.A Group-Theoretic Model for Symmetric Interconnection Networks.IEEE Transactions on Computers,1989,38(4):555-565.
[6] LEIGHTON F T.Complexity Issues in VLSI:Optimal Layouts for Shuffle-exchange graphs and other networks//Cambridge,MA:MIT Press.1983:76-93.
[7] PEASE M C.The Indirect Binary n-cube Microprocessor Array.IEEE Transactions on Computers,1977,C-26:458-473.
[8] EI-AMAWY A,LATIFI S.Properties and Performance of Folded Hypercubes.IEEE Transactions on Parallel and Distributed Systems,1991,2(3):31-42.
[9] LAKSHMIVARAHAN S,JWO J S,DHALL S K.Symmetry in Interconnection Networks Based on Cayley graphs of permutation groups:A Survey.Parallel Computing,1993,19(4):361-407.
[10] XU J M.Combinatorial Theory in Networks.BeiJing:Science Press,2007.
[11] XU J M.Combinatorial Theory in Networks.BeiJing:Science Press,2013.
[12] SHI H Z.Some New Cartesian Product interconnection Networks.Computer Science,2013,40(6A):265-270,306.
[13] SHI H Z,LU J B.On ConJectures of Interconnection Networks.Computer Engineering and Applications,2008,44(31):112-115.
[14] SHI H Z.Regular Graph Connected Cycle:A Unity Model of Many Interconnection Networks//Proceedings of the Tenth National Conference of Operations Research Society of China.BeiJing,2010:202-208.
[15] SHI H Z,SHI Y.A New Model for Interconnection Networks:k-hierarchical Ring and r-layer graph networks.
[16] SHI H Z,SHI Y.A Hierarchical Ring Group-theoretic Model for Interconnection Networks.
[17] SHI H Z,SHI Y.Cell-breading graph Model for Interconnection Networks.
[18] SHI H Z.New Model for Interconnection Networks:Multipartite Group-theoretic Model.Computer Science,2013,40(9):21-24.
[19] SHI H Z.A Ring-theoretic Model-for Interconnection Network.BeiJing:Doctor Thesis,Institute of Applied Mathematics,Academia Sinica,1998.
[20] SHI H Z,NIU P F,MA J Y,et al.A Vector Graph Model for Interconnection Networks.Operations Research Transactions,2011,15(3):115-123.
[21] SHI H Z,SHI Y.M-layers Binary Graph Model for Interconnection Networks.Computer Science,2017,44(Z2):308-311.
[22] LIU X,GUO H,SUN R J,et al.The Characteristic Analysis and Exascale Scalability Research of Large Scale Parallel Applications on Sunway TaihuLight Supercomputer.Chinese Journal of Computers,2018,41(10):2209-2220.
[23] DU D Z,HSU F,HWANG F K.Hamiltonian Property of d-consecutive Digraphs.Mathematical and Computing Modeling,1993,17(11):61-63.
[1] MA Yu-yin, ZHENG Wan-bo, MA Yong, LIU Hang, XIA Yun-ni, GUO Kun-yin, CHEN Peng, LIU Cheng-wu. Multi-workflow Offloading Method Based on Deep Reinforcement Learning and ProbabilisticPerformance-awarein Edge Computing Environment [J]. Computer Science, 2021, 48(1): 40-48.
[2] LI Li. Survey on Multi-winner Voting Theory [J]. Computer Science, 2021, 48(1): 217-225.
[3] WANG Rui-ping, JIA Zhen, LIU Chang, CHEN Ze-wei, LI Tian-rui. Deep Interest Factorization Machine Network Based on DeepFM [J]. Computer Science, 2021, 48(1): 226-232.
[4] ZHANG Yu-shuai, ZHAO Huan, LI Bo. Semantic Slot Filling Based on BERT and BiLSTM [J]. Computer Science, 2021, 48(1): 247-252.
[5] LI Yin, LI Bi-xin. Memory Leak Test Acceleration Based on Script Prediction and Reconstruction [J]. Computer Science, 2020, 47(9): 31-39.
[6] MA Li-bo, QIN Xiao-lin. Topic-Location-Category Aware Point-of-interest Recommendation [J]. Computer Science, 2020, 47(9): 81-87.
[7] ZHAO Hui-qun, WU Kai-feng. Big Data Valuation Algorithm [J]. Computer Science, 2020, 47(9): 110-116.
[8] YOU Lan, HAN Xue-wei, HE Zheng-wei, XIAO Si-yu, HE Du, PAN Xiao-meng. Improved Sequence-to-Sequence Model for Short-term Vessel Trajectory Prediction Using AIS Data Streams [J]. Computer Science, 2020, 47(9): 169-174.
[9] DONG Xin-yue, FAN Rui-dong, HOU Chen-ping. Active Label Distribution Learning Based on Marginal Probability Distribution Matching [J]. Computer Science, 2020, 47(9): 190-197.
[10] LUO Xiang-yu, XU Hang-na, ZENG Hao-cheng, CHEN Zu-xi, YANG Fan. Symbolic Model Checking for Discrete Real-time Linear Dynamic Logic [J]. Computer Science, 2020, 47(9): 204-212.
[11] XU He, WU Man-xing, LI Peng. RFID Indoor Relative Position Positioning Algorithm Based on ARIMA Model [J]. Computer Science, 2020, 47(9): 252-257.
[12] GUO Jie, GAO Xi-ran, CHEN Li, FU You, LIU Ying. Parallelizing Multigrid Application Using Data-driven Programming Model [J]. Computer Science, 2020, 47(8): 32-40.
[13] XIE Wen-kang, FAN Wei-bei, ZHANG Yu-jie, XU He, LI Peng. ENLHS:Sampling Approach to Auto Tuning Kafka Configurations [J]. Computer Science, 2020, 47(8): 119-126.
[14] HU Lei, YAN Li. Uncertain XML Model Based on Fuzzy Sets and Probability Distribution and Its Algebraic Operations [J]. Computer Science, 2020, 47(7): 21-30.
[15] FENG Kai, LI Jing. Study on Subnetwork Reliability of k-ary n-cubes [J]. Computer Science, 2020, 47(7): 31-36.
Full text



[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[2] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[3] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[4] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[5] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99 .
[6] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105 .
[7] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111 .
[8] GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping. Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph[J]. Computer Science, 2018, 45(4): 112 -116 .
[9] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121 .
[10] WANG Zhen-chao, HOU Huan-huan and LIAN Rui. Path Optimization Scheme for Restraining Degree of Disorder in CMT[J]. Computer Science, 2018, 45(4): 122 -125 .