Research On An Implementation of Fault-Tolerant Processor Interconnected Networks

在本研究中，我们开发了在弦环网络和超立方连接网络中实现任意BPC排列的算法，并评估了在弦环网络、超立方连接网络和omega网络3种网络中实现一些典型BPC排列所需的步数。本文提出了一种实现任意BPC置换的算法，对于估计任意大小网络中所需的路由步数，即估计广义弦环网络中所需步数的上界，具有一定的实用价值。另一方面，在超立方体连接和omega网络中所需的步骤数几乎都是最小值。已经报道了一些适用于立方体或网状连接网络的BPC路由算法，这些算法假设网络中的每条链路同时是双向的。本研究在弦环和超立方体连接网络中同时给出的结果是单向通信。对于omega或delta网络，首先讨论了使用路由决策算法和考虑某些固有特性的改进算法时所需的复杂性有多大不同，并通过获取真实数据来解决。接下来，在存在故障和不存在故障的情况下，在delta网络中实现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.