交换折叠超立方体网络结构的研究

发布时间：2018-05-20 20:53

本文选题：超立方体 + 负载均衡　；参考：《大连理工大学》2014年硕士论文

【摘要】：拓扑结构是网络中最重要的设计问题。现有的网络拓扑结构如线性,环形,星形,二叉树等。近年来,超立方体型网络已经受到多方关注,由于超立方体很多优秀特性吸引着大规模并行超级计算系统。本文中的两个创新点分别是： 1、我们提出和分析了新的超立方体型结构称为交换折叠超立方体。该新型超立方体结构是在交换超立方体的基础上通过添加二进制位距离最远的结点组成的。相对于交换超立方体,新型超立方体结构具有直径减半,更低的成本因素和恒定的结点度。对于新提出的结构,我们提出其最佳的路由算法,它是简单,易于实现。并比较了超立方体、交换超立方体、折叠超立方体、交换折叠超立方体等各种网络的网络参数属性。证明了交换折叠超立方体比交换超立方体拥有更短的直径,几乎是交换超立方体的一半,相对于折叠超立方体而言,交换折叠超立方体具有更低的硬件成本,此外,交换折叠超立方体拥有突出的成本因素,更短的延迟,更少的信息流量密度。 2、负载均衡是影响网络性能指标的重要因素,因此有必要对提出的新型网络进行负载均衡研究。我们提出基于超立方体经典维负载算法的改进负载均衡算法。并考虑了在容错环境下,对J.wu提出的容错超立方体结构的负载均衡算法进行改进。提出了具有m(Dm2D-3)容错度的负载均衡算法,其中m是立方体的错误链接数量,D是结构的容错直径。同时,算法时间复杂度为O(mn)。
[Abstract]:Topology is the most important design problem in the network. The existing network topology is such as linear, ring, star, two fork. In recent years, hypercube network has attracted much attention, because a lot of excellent properties of hypercube attract large scale parallel supercomputing system.
The two innovation points in this paper are:
1, we propose and analyze the new hypercube structure called exchange folded hypercubes. The new hypercube is composed of the most distant nodes with binary bit distance on the basis of the switched hypercube. Relative to the switched hypercube, the new hypercube has a half, lower cost factor and a lower cost factor. For the newly proposed structure, we propose its best routing algorithm, which is simple and easy to implement. It compares the network parameter attributes of Hypercubes, swapping hypercubes, folded hypercubes, swapping folded hypercubes and other networks. It is proved that the alternating folded hypercube is shorter than the exchange hypercube. The diameter, almost half of the switched hypercube, has lower hardware cost than the folded hypercube. In addition, the switched hypercube has a prominent cost factor, a shorter delay, and less information flow density.
2, load balancing is an important factor affecting network performance indicators. Therefore, it is necessary to carry out a load balancing study on the proposed new network. We propose an improved load balancing algorithm based on the hypercube classic dimension load algorithm, and consider the load balancing algorithm for the fault-tolerant hypercube structure proposed by J.wu in the fault-tolerant environment. Improvement. A load balancing algorithm with m (Dm2D-3) tolerance is proposed, in which m is the number of false links in the cube and D is the fault tolerance diameter of the structure. Meanwhile, the time complexity of the algorithm is O (MN).
【学位授予单位】：大连理工大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TP393.02

【共引文献】