交换超立方网的自适应性无死锁路由算法

J4 ›› 2013, Vol. 35 ›› Issue (2): 13-17.

交换超立方网的自适应性无死锁路由算法

曹入辉，梁家荣，王新阳，豆秋丽

（广西大学计算机与电子信息学院，广西南宁 530004）

收稿日期:2011-11-03 修回日期:2012-03-14 出版日期:2013-02-25 发布日期:2013-02-25
基金资助:
国家自然科学基金资助项目(61064002)；教育部新世纪优秀人才支持计划专项资助项目（NCET060756）

An adaptive deadlockfree routing algorithm in the exchanged hypercube

CAO Ruhui,LIANG Jiarong,WANG Xinyang,DOU Qiuli

(School of Computer and Electronic Information,Guangxi University,Nanning 530004,China)

Received:2011-11-03 Revised:2012-03-14 Online:2013-02-25 Published:2013-02-25

摘要/Abstract

摘要：

交换超立方网是一种新提出来的互连网络。首先，利用图论的方法研究了交换超立方网的拓扑性质，引入了相似子网的概念，得出相似子网和超立方体同构的结论；然后，利用将物理通道分成两条虚拟通道的方法，给出了一种交换超立方网的自适应性路由算法，并从理论上证明了该算法的无死锁性。

关键词: 交换超立方网, 无死锁路由, 虚拟网络, Pcube算法

Abstract:

The exchanged hypercube is a novel interconnection network. Firstly, the method of graph theory is employed to analyze the topological property of the exchanged hypercube, the concept of similar subnet is defined and the result that the hypercube and the similar subnet are isomorphic is obtained. Secondly, an adaptive routing algorithm is proposed by using the technique of dividing a physical channel into two virtual channels. Finally, the theoretical analysis shows that the algorithm is deadlockfree.

Key words: exchanged hypercube;deadlockfree routing;virtual internet;Pcube algorithm

曹入辉，梁家荣，王新阳，豆秋丽. 交换超立方网的自适应性无死锁路由算法[J]. J4, 2013, 35(2): 13-17.

CAO Ruhui,LIANG Jiarong,WANG Xinyang,DOU Qiuli. An adaptive deadlockfree routing algorithm in the exchanged hypercube[J]. J4, 2013, 35(2): 13-17.

[1]	朱国晖，张茵，刘秀霞，孙天骜. 基于两次优先级排序的虚拟网络映射算法[J]. 计算机工程与科学, 2020, 42(05): 795-802.
[2]	刘少楠，李玲，苑迎，蒋国佳，王聪，吕艳霞. 基于节点连通性排序的虚拟网络映射算法[J]. 计算机工程与科学, 2019, 41(12): 2101-2109.
[3]	苟建国1，吕高锋1，孙志刚1，苟丽萍2. 网络功能虚拟化技术综述[J]. 计算机工程与科学, 2019, 41(02): 260-267.
[4]	刘向东，刘奎，王聪. 基于离散粒子群的节点可重用虚拟网络映射算法[J]. J4, 2015, 37(02): 276-280.
[5]	蔡志平陈彬肖侬王志英. 虚拟计算环境中的虚拟网络[J]. J4, 2008, 30(11): 1-4.