By Topic

A fault-tolerant parallel processor modeled by a linear cellular automaton

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
$31 $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

2 Author(s)
Tsunoyama, M. ; Fac. of Eng., Technol. Univ. of Nagaoka, Japan ; Naito, S.

The authors present the fundamental concepts for realizing a fault-tolerant parallel processor modeled by a linear cellular automaton. They give the reconfiguration scheme under this model. They treat the processing elements in the processor as cells of the cellular automaton. They regard the operating states of the elements as states of the cells. The processor can be reconfigured easily and quickly by changing the states of its processing elements when faults are detected. The reconfiguration scheme for the processor utilizes the characteristics of polynomial rings over GF(q), where q is a power of a prime number.<>

Published in:

Fault-Tolerant Computing, 1988. FTCS-18, Digest of Papers., Eighteenth International Symposium on

Date of Conference:

27-30 June 1988