An Efficient Method for Reconfiguring the 11/2 Track-Switch Mesh Array
スポンサーリンク
概要
- 論文の詳細を見る
As VLSI technology has developed, the interest in implementing an entire or significant part of a parallel computer system using wafer scale integration is growing. The major problem for the case is the possibility of drastically low yield and/or reliability of the system if there is no strategy for coping with such situations. Various strategies to restructure the faulty physical system into the fault-free target logical system are described in the literature [1]-[5]. In this paper, we propose an efficient approximate method which can reconstruct the 11/2 track-switch mesh arrays with faulty PEs using hardware as well as software. A logical circuit added to each PE and a network connecting the circuits are used to decide spare PEs which compensate for faulty PEs. The hardware compexity of each circuit is much less than that of a PE where the size of each additional curcuit is independent of array sizes and constant. By using the exclusive hardware scheme, a built-in self-reconfigurable system without using a host computer is realizable and the time for reconfiguring arrays becomes very short. The simulation result of the performance of the method shows that the reconstructing efficiency of our algorithm is a little less than those of the exaustive and Shigei's ones [6] and [7], but much better than that of the neural one [3]. We also compare the time complexities of reconstructions by hardware as well as software, and the hardware complexity in terms of the number of gates in the logical circuit added to each PE among the other methods.
- 社団法人電子情報通信学会の論文
- 1999-12-25
著者
-
Takanami Itsuo
Faculty Of Engineering Iwate University
-
HORITA Tadayoshi
Faculty of Engineering, Iwate University
-
Horita Tadayoshi
Faculty Of Engineering Iwate University
-
TAKANAMI Itsuo
Faculty of Engineering, Iwate University
関連論文
- Leaf-Size Bounded Real-Time Synchronized Alternating One-Way Multicounter Machines
- Closure properties of alternating one-way multihead finite automata with constant leaf-sizes
- Multihead Finite Automata with Markers (Special Section on Discrete Mathematics and Its Applications)
- A Note on One-Way Multicounter Machines and Cooperating Systems of One-Way Finite Automata
- Some Hierarchy Results on Multihead Automata over a One-Letter Alphabet
- Hierarchical Properties of Realtime One-Way Alternating Multi-Stack-Counter Automata (Special Section on Discrete Mathematics and Its Applications)
- Three-Dimensionally Fully Space Constructible Functions
- Self-Reconstruction of 3D Mesh Arrays with 11/2-Track Switches by Digital Neural Circuits (Special Issue on Integrated Electronics and New System Paradigms)
- A Built-in Self-Reconfigurable Scheme for 3D Mesh Arrays
- An Efficient Method for Reconfiguring the 11/2 Track-Switch Mesh Array
- A Built-In Self-Reconstruction Approach for Partitioned Mesh-Arrays Using Neural Algorithm (Special Issue on Architectures, Algorithms and Networks for Massively parallel Computing)