By Topic

Scaling theory for fault stealing algorithms in large systolic arrays

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)
W. S. Stornetta ; Dept. of Phys., Stanford Univ., CA, USA ; B. A. Huberman ; T. Hogg

The performance of fault-stealing algorithms for very large, multipipeline systolic arrays is considered. Extensions of an existing algorithm are proposed, and with these extensions the algorithm is shown to work for large array sizes. Using the modified algorithms as a testbed, a scaling theory that predicts, on the basis of performance for a single small array, the performance of the algorithm for arbitrary array size, defect rate, and number of spares is introduced. The theory differs from current approaches in that it has both analytical and empirical components, and in that it accurately predicts system performance, rather than providing bounds on it

Published in:

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  (Volume:9 ,  Issue: 3 )