A Built-In Self-Reconstruction Approach for Partitioned Mesh-Arrays Using Neural Algorithm (Special Issue on Architectures, Algorithms and Networks for Massively parallel Computing)
スポンサーリンク
概要
- 論文の詳細を見る
Various reconfiguration schemes against faults of mesh-connected processor arrays have been proposed. As one of them, the mesh-connected processor arrays model based on single-track switches was proposed in [1]. The model has an advantage of its inherent simplicity of the routing hardware. Furthermore, the 2 1/2 track switch model [2] and the multiple track switch model [3] were proposed to enhance yields and reliabilities of arrays. However, in these models, Simplicity of the routing hardware is somewhat lost because multiple tracks are used for each row and column. In this paper, we present a builtin self-reconstruction approach for mesh-connected processor arrays which are partitioned into sub-arrays each using single-track switches. Spare PEs which are located on the boundaries of the sub-arrays compensate faulty PEs in these sub-arrays. First, we formulate a reconfigulation algorithm for partitioned mesh-arrays using a Hopfield-type neural network, and then its performance for reconfigulation in terms of survival rates and reliabilities of arrays and processing time are investigated by computer simulations. From the results, we can see that high reliabilities are achieved while processing time is a little and hardware overhead (links and switches) required for reconstruction is as same as that for the 1 1/2 track switch model. Next, we present a hardware implementation of the neural algorithm so that a built-in self-reconfigurable scheme may be realized.
- 社団法人電子情報通信学会の論文
- 1996-08-25
著者
-
Takanami Itsuo
Faculty Of Engineering Iwate University
-
HORITA Tadayoshi
Faculty of Engineering, Iwate University
-
Horita T
Polytechnic Univ. Sagamihara‐shi Jpn
-
Horita Tadayoshi
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)