Computer Science ›› 2023, Vol. 50 ›› Issue (4): 249-256.doi: 10.11896/jsjkx.220100019

• Computer Network • Previous Articles     Next Articles

Optimal Embedding of Hierarchical Cubic Networks into Linear Arrays of NoC

GUO Ruyan1, WANG Yan1, FAN Jianxi1, FAN Weibei2   

  1. 1 School of Computer Science and Technology,Soochow University,Suzhou,Jiangsu 215006,China
    2 School of Computer,Nanjing University of Posts and Telecommunications,Nanjing 210003,China
  • Received:2022-01-04 Revised:2022-05-16 Online:2023-04-15 Published:2023-04-06
  • About author:GUO Ruyan,born in 1998,postgra-duate.Her main research interests include parallel and distributed systems and graph embedding.
    WANG Yan,born in 1977,Ph.D,asso-ciate professor.Her main research interests include parallel and distributed systems,interconnection architectures,social networks,algorithms and graph theory.
  • Supported by:
    Joint Fund of the National Natural Science Foundation of China(U1905211) and Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions.

Abstract: With the advent of the era of big data,the demand of large-scale computing makes the requirements on the performance of chips constantly increasing.Network-on-Chip(NoC),as a network-communication-centered interconnection structure on chips,has achieved a good tradeoff in all aspects of communication.The physical layout and interconnection mode of NoC components have a significant impact on the overall performance of the chip(such as signal delay,circuit cost).Due to the limited area of the chip,minimizing the total length of wires connecting components,in other words,minimizing wirelength,is considered as the key of chip design.The hierarchical cubic network is an excellent interconnection network which has less communication delay,better reliability and greater scalability while the linear array is one of the common topologies of NoC.When the hierarchical cubic network is ported to the linear array,the structure and algorithm of hierarchical cubic network can be simulated on the linear array.Graph embedding is a key technology to realize network porting.In graph embedding,the goal of minimizing the total wire length can be achieved by finding the optimal embedding with minimum wirelength.This paper mainly studies the optimal embedding problem of hierarchical cubic networks into linear arrays with minimum wirelength.Firstly,by studying the optimal set of the hierarchical cubic network,an embedding scheme hel of hierarchical cubic networks into linear arrays is proposed,and it is proved that the wirelength under hel is minimum compared with other embedding schemes,that is, hel is an optimal embedding.Then,the exact value of the wirelength under hel and an embedding algorithm with O(N) time complexity are given,where N=22n is the number of vertices of the n-dimensional hierarchical cube network.Furthermore,an algorithm of physical linear layout in NoC for hierarchical cubic networks is proposed.Finally,comparison experiments are conducted to evaluate the performance of embed-ding hel.

Key words: Network-on-Chip, Graph embedding, Wirelength, Hierarchical cubic networks, Linear arrays

CLC Number: 

  • TP393
[1]WANG X J,SHI F,ZHANG H.KLSAT:An application mapping algorithm based on Kernighan-Lin partition and simulated annealing for a specific WK-recursive NoC architecture[C]//International Conference on Network and Parallel Computing.Springer International Publishing,2019:31-42.
[2]MOSTAFA A,TURKI F A.Topological properties of hierarchi-cal interconnection networks:a review and comparison[J].Journal of Electrical and Computer Engineering,2011,2011:1-12.
[3]GHOSE K,DESAI K R.Hierarchical cubic networks[J].IEEE Transactions on Parallel and Distributed Systems,1995,6(4):427-435.
[4]ZHOU S M,SONG S L,YANG X Y,et al.On conditional fault tolerance and diagnosability of hierarchical cubic networks[J].Theoretical Computer Science,2016,609:421-433.
[5]LIU Z,FAN J X,ZHOU J Y,et al.Fault-tolerant embedding of complete binary trees in locally twisted cubes[J].Journal of Parallel and Distributed Computing,2017,101:69-78.
[6]BOSSARD A,KANEKO K.Node-to-set disjoint-path routing in hierarchical cubic networks[J].Computer Journal,2012,55(12):1440-1446.
[7]LIU H Q,ZHANG S Z,LI D.On g-extra conditional diagno-sability of hierarchical cubic networks[J].Theoretical Computer Science,2019,790:66-79.
[8]LI X J,LIU M,YAN Z,et al.On conditional fault tolerance of hierarchical cubic networks[J].Theoretical Computer Science,2019,761:1-6.
[9]ZHAO S L,HAO R X,WU J.The generalized 4-connectivity of hierarchical cubic networks[J].Discrete Applied Mathematics,2021,289:194-206.
[10]FAN W B,FAN J X,LIN C K,et al.Embedding exchanged hypercubes into rings and ladders[C]//International Conference on Algorithms and Architectures for Parallel Processing.Sprin-ger International Publishing,2018:3-17.
[11]WANG W,QIAO L,TANG Z Z.Survey on the Networks-on-Chip interconnection topologies[J].Computer Science,2011,38(10):1-5.
[12]MANUEL P,RAJASINGH I,RAJAN B,et al.Exact wirelength of hypercubes on a grid[J].Discrete Applied Mathematics,2009,157(7):1486-1495.
[13]AROCKIARAJ M,ABRAHAM J,QUADRAS J,et al.Linear layout of locally twisted cubes[J].International Journal of Computer Mathematics,2017,94(1):56-65.
[14]SHALINI A J,ABRAHAM J,AROCKIARAJ M.A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout[J].Discrete Applied Mathematics,2020,286:10-18.
[15]FAN W B,FAN J X,LIN C K,et al.Optimally embedding 3-ary n-cubes into grids[J].Journal of Computer Science and Techno-logy,2019,34(2):372-387.
[16]FAN W B,FAN J X,LIN C K,et al.An efficient algorithm for embedding exchanged hypercubes into grids[J].Journal of Supercomputing,2019,75(2):783-807.
[17]XIA J J,WANG Y,FAN J X,et al.Embedding augmented cubes into grid networks for minimum wirelength[C]//International Conference on Algorithms and Architectures for Parallel Processing.Springer International Publishing,2020:47-61.
[18]BEZRUKOV S L,CHAVEZ J D,HARPER L H,et al.Embedding of hypercubes into grids[C]//International Symposium on Mathematical Foundations of Computer Science.Springer,1998:693-701.
[19]STALIN MARY R,RAJASINGH I.Embedding of completegraphs and cycles into grids with holes[J].Procedia Computer Science,2020,172:115-121.
[20]PATEL A,KUSALIK A J,MCCROSKY C.Area-efficient VLSI layouts for binary hypercubes[J].IEEE Transactions on Computers,2000,49(2):160-169.
[1] LI Yong, WU Jing-peng, ZHANG Zhong-ying, ZHANG Qiang. Link Prediction for Node Featureless Networks Based on Faster Attention Mechanism [J]. Computer Science, 2022, 49(4): 43-48.
[2] YANG Hui, TAO Li-hong, ZHU Jian-yong, NIE Fei-ping. Fast Unsupervised Graph Embedding Based on Anchors [J]. Computer Science, 2022, 49(4): 116-123.
[3] LIANG Yao, XIE Chun-li, WANG Wen-jie. Code Similarity Measurement Based on Graph Embedding [J]. Computer Science, 2022, 49(11A): 211000186-6.
[4] SONG Li-guo, HU Cheng-xiu, WANG Liang. Summary and Analysis of Research on ManyCore Processor Technologies [J]. Computer Science, 2022, 49(11A): 211000012-7.
[5] FU Kun, GUO Yun-peng, ZHUO Jia-ming, LI Jia-ning, LIU Qi. Semantic Information Enhanced Network Embedding with Completely Imbalanced Labels [J]. Computer Science, 2022, 49(11): 109-116.
[6] XING Chang-zheng, ZHU Jin-xia, MENG Xiang-fu, QI Xue-yue, ZHU Yao, ZHANG Feng, YANG Yi-ming. Point-of-interest Recommendation:A Survey [J]. Computer Science, 2021, 48(11A): 176-183.
[7] LI Lu-lu, QIU Xue-hong, ZHOU Duan and ZHANG Jian-xian. Research on Fault Tolerant Technology for Networks-on-Chip [J]. Computer Science, 2018, 45(3): 305-310.
[8] HOU Rui WU Ji-gang. Efficient Reduction Algorithms for Directed Acyclic Graph [J]. Computer Science, 2015, 42(7): 78-84.
[9] WANG Juan,DU Hai-shun,HOU Yan-dong and JIN Yong. Graph Embedding Projective Non-negative Matrix Factorization Method for Image Feature Extraction [J]. Computer Science, 2014, 41(8): 311-315.
[10] . Hyperspectral Remote Sensing Image Classification Based on MFA and Knns [J]. Computer Science, 2012, 39(6): 261-265.
[11] . HHSR;A Prototype of Network-on-chip with Commands and Data Transferred Separately [J]. Computer Science, 2012, 39(4): 299-303.
[12] WANG Wei,QIAO Lin,TANG Zhi-zhong. Survey on the Networks-on-Chip Interconnection Topologies [J]. Computer Science, 2011, 38(10): 1-5.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!