A new kind of fault - tolerant model , lip induced embedding model , is proposed . some conceptions , properties , merits and the algorithm on lip are given . corresponding to the algorithm , a c + + realization program is present , which can get the precise length value of lip when n equals 6 and 7 本文即是从上述两个方面,对超立方体网络的容错性和路由算法进行研究,主要研究内容如下: 1 .提出一种新的并行计算机网络容错模型- lip导出嵌入模型,包括与lip相关的概念、性质、优点,给出了超立方体网络中求lip的算法;针对此算法,文中给出了其c + +实现程序,并求出了当维数n = 6 , 7时lip长度的精确值。
It has small diameter , strong expansibility , symmetrical structure and simple path searching algorithms , etc . , what more , many interconnection networks with different topologies can be easily embedded in it . so it becomes one of the most important and attractive network models . in this thesis , based on the above two aspects , the fault - tolerance and routing algorithms of the hypercube are studied 超立方体网络是多处理机系统中常见的一种互连网络,这种网络拓扑结构由于具有直径小、可扩展性强、结构对称、网络寻路算法简单等优点,且多种拓扑结构的互连网络都可以很容易的嵌入其中,因而成为最重要和最具吸引力的网络模型之一。
The recently introduced interconnection network , the crossed cube , has attracted much attention in the parallel processing area due to its many attractive features , for example , its small diameter , strong connectivity , the ability to simulate other architectures , and its high degrees of diagnosability etc . in order to improve the faulty tolerance of the crossed cube , we proposed a new network , the enhanced crossed cube 交叉立方体互连网络是超立方体的一个变型，由于它有一些比超立方体更好的性质，如小的网络直径， hamilton连通性，一棵完全二叉树可以扩张1嵌入交叉立方体中等等，所以交叉立方体在并行处理领域越来越受到人们的重视。本文选择交叉立方体，及该立方体的一个变型?加强交叉立方体作为研究对象，围绕上述问题进行了研究。
With the development of computer networks and computing science , paralleling computer and interconnection networks , covering mathematics 、 computing science 、 information science and so on , are becoming one of the hotspots of computer science research . all kinds of interconnection networks with different topologies , such as ring , mesh , hypercube , star topology network etc . , have been received rapidly development 随着计算机网络技术与计算科学的发展,并行计算机及其互连网络作为一个跨数学、计算科学与信息科学等多门学科的领域,逐渐成为计算机科学研究的热点之一,各种拓扑结构的互连网络,如环、 mesh 、超立方体、星型网络等得到迅速发展。
In order to efficiently analyze the fault - tolerance of hypercube network and to propose a better fault - tolerant algorithms , the evaluation of an upper bound and a lower bound on the lip are given . a very significative conjecture on the bound of lip is obtained . besides , the 2 .为了更好的分析超立方体网络的容错性,提出更为优越的容错路由算法,文章给出了超立方体网络中lip容错模型的上下界估计,并给出一个非常有意义的猜想,而且结合程序结果对上下界及猜想进行了验证。
