Fault tolerant cellular spaces

Nishio, Hidenosuke; Kobuchi, Youichi

doi:10.1016/s0022-0000(75)80065-1

Cited by 34 publications

(8 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One of the first to explore fault tolerance in digital systems was von Neumann (1956) who utilized levels of redundancy to build reliable digital circuits from unreliable components. Later in 1975, two sets of researchers, (Harao and Noguchi (1975)) and (Nishio and Kobuchi (1975)), set a more formal stage for studying reliability in cellular automata. In these papers, failure of cells was spatially restricted to make the algebraic analysis feasible.…”

Section: Related Workmentioning

confidence: 99%

Practical Fault Tolerant 2D Cellular Automata

Janke¹,

Whitehead

2015

07/20/2015-07/24/2015

View full text Add to dashboard Cite

Cellular automata often suffer from a level of brittleness that makes them susceptible to even the smallest unexpected environmental changes. We propose a method of converting CAs into more robust structures called meta-CAs that utilize cell redundancy along with added rules to correct errors and reproduce the functionality of the original CA. We show that the use of these meta-CAs can greatly increase the probability of CAs being intact when executing in an environment where cells fail on each step with a small probability.

show abstract

Section: Related Workmentioning

confidence: 99%

Practical Fault Tolerant 2D Cellular Automata

Janke¹,

Whitehead

2015

07/20/2015-07/24/2015

View full text Add to dashboard Cite

show abstract

“…Nevertheless, realtime is still defined by the initial length of the input and the input is accepted whenever the leftmost cell at some computation step enters an accepting state. A related concept is that of fault tolerant CA (see, for example, [6,12,15,18]). These are CA where cells may become defective, that is, they cannot process the information from its neighbors any longer, but only can forward the unchanged information to its neighbors.…”

Section: Introductionmentioning

confidence: 99%

Shrinking one-way cellular automata

2016

View full text Add to dashboard Cite

We investigate cellular automata as acceptors for formal languages. In particular, we consider real-time one-way cellular automata (OCA) with the additional property that during a computation any cell of the OCA has the ability to dissolve itself and we call this model shrinking one-way cellular automata (SOCA). It turns out that real-time SOCA are more powerful than real-time OCA, since they can accept certain linear-time OCA languages. Additionally, a construction is provided that enables real-time SOCA to accept the reversal of real-time iterative array languages. Finally, restricted real-time SOCA are investigated which are allowed to dissolve only a number of cells that is bounded by some function. In this case, an infinite strict hierarchy of language classes is obtained.

show abstract

“…In the context of cellular arrays, early work on fault-tolerance is reported in [39]. This model can correct at most one error in 19 cells, but to this end each cell needs read access to the states of 49 cells in its neighborhood, which is much higher than the four cells usual in cellular arrays (von Neumann neighborhood).…”

Section: Introductionmentioning

confidence: 99%

Fault-Tolerance in Nanocomputers: A Cellular Array Approach

Peper¹,

Lee²,

Abo³

et al. 2004

IEEE Trans. Nanotechnology

View full text Add to dashboard Cite

Asynchronous cellular arrays have gained attention as promising architectures for nanocomputers, because of their lack of a clock, which facilitates low power designs, and their regular structure, which potentially allows manufacturing techniques based on molecular self-organization. With the increase in integration density comes a decrease in the reliability of the components from which computers are built, and implementations based on cellular arrays are no exception to this. This paper advances asynchronous cellular arrays that are tolerant to transient errors in up to one third of the information stored by its cells. The cellular arrays require six rules to describe the interactions between the cells, implying less complexity of the cells as compared to a previously proposed (nonfault-tolerant) asynchronous cellular array that employs nine rules.

show abstract

Fault tolerant cellular spaces

Cited by 34 publications

References 1 publication

Practical Fault Tolerant 2D Cellular Automata

Practical Fault Tolerant 2D Cellular Automata

Shrinking one-way cellular automata

Fault-Tolerance in Nanocomputers: A Cellular Array Approach

Contact Info

Product

Resources

About