Research On An Implementation of Fault-Tolerant Processor Interconnected Networks

本文提出了在圆环网络和超立方体连通网络中实现任意BPC置换的算法，并计算了在三种网络中实现某些典型BPC置换所需的步骤：弦环网络，超立方体连接网络，本文提出子一种实现任意BPC置换算法，该算法对于估计网络中所需路由步数是有价值网络的任意大小，即估计的上限所需的步骤在广义弦环网络。另一方面，超立方体连接和欧米茄网络所需的步数几乎都是真实的最小值。已有一些立方体或网状连接网络的BPC路由算法，这些网络中的每条链路都假设是双向的。在弦环和超立方体连通网络中，本文的结果同时适用于单向通信。对于Ω或Delta网络，首先讨论了采用路由判决算法和考虑了某些固有性质的改进算法时所要求的复杂性有多大的不同，并通过获取实际数据来求解。接下来，当故障存在时和不存在时，需要hOW许多遍来实现BPC置换，例如位恢复置换、矩阵转置置换、完全移位置换和位补偿置换。

In this rsearch, we developed algorithms to realize an arbitrary BPC permutation in chrdal ring networks and hypercube connected networks, and evalated the number of required steps to realize some typical BPC permutations in 3 kinds f networks : chordal ring networks, hypercube cnnected netwoks, and omega networks.A developmet of an algorithm to realize an arbitrary BPC permutatin is of value for the estimation of routing steps required in a network of an arbitrary size, that is for the estimation of the upper bound of required steps in a generalized Chordal ring network. On the other hand, the numbers of required steps in both hypercube cnnection and omega networks are almost real the minimum values. Some BPC routing algorithms for cube or mesh connected networks has been reported, and each link in these networks was assumed to be bidirectional simultaneously. The results presented in Chordal ring and hypercube connected networks in this research are for unidirectional communications simultaneously. For omega or delta networks, first, how differnt are the comlexities required when using a route decision algorithm and an improved algorithm having taken some inherent properties into consideration is discussed and solved by obtaining rea data. Next, hOW many passes are required to realize BPC permutations such as Bit-Reversal, Matrix-Transpose, Perfect-Shuffe, and Bit-Compement permutations n delta networks when when faults are present and when not present.