By Topic

Switching networks and neural algorithms for reconstructing mesh-connected processor arrays with spares on their sides

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
I. Takanami ; Dept. of Inf. Eng., Iwate Univ., Morioka, Japan ; Y. Hisanaga ; K. Inoue

First, we present switching networks and a reconstruction strategy for mesh-connected processor arrays with linear arrays of spares on their left/right/upper/bottom sides. Each faulty processor is compensated by a spare on any one of left/right/upper/bottom sides. The reconstruction is done by shifting vertically first and then horizontally. Such a new reconstruction strategy leads to the simple and systematic switching operations for the networks. The networks are regular and comparatively simple. The distances between logically adjacent processors after the reconstruction are bounded by a constant. Next, we describe exhaustive algorithms for reconstruction. It seems that efficient ones can not be found. So, using a Hopfield-type neural network model, we present algorithms for the two cases where the linear arrays of spares are on the right and bottom sides, and on the right and left and bottom sides, and show their effectiveness by computer simulation

Published in:

Test Symposium, 1994., Proceedings of the Third Asian

Date of Conference:

15-17 Nov 1994