Massively Parallel Pattern Recognition with Link Failures
The capabilities of reliable computations in linear cellular arrays with communication failures are investigated in terms of syntactical pattern recognition.
In particular we consider very fast, i. e. real-time, computations. It is wellknown that real-time one-way arrays are strictly less powerful than realtime two-way arrays. Here it is shown that the sets of patterns reliably recognizable by real-time arrays with link failures are strictly in between the sets of (intact) one-way and (intact) two-way arrays. Hence, the failures cannot be compensated in general but, on the other hand, do not decrease the computing power to that one of one-way arrays.
Unable to display preview. Download preview PDF.
- 4.Gács, P. and Reif, J. A simple three-dimensional real-time reliable cellular array. J. Comput. System Sci. 36 (1988), 125-147. 392Google Scholar
- 8.Kutrib, M. and Löwe, J.-T. Fault tolerant parallel pattern recognition. Cellular Automata for Research and Industry (ACRI 2000), 2000, to appear. 393Google Scholar
- 9.Kutrib, M. and Löwe, J.-T. Massively parallel pattern recognition with link failures. Research Report 0003, Institut für Informatik, Universität Giessen, Giessen, 2000. 397Google Scholar
- 11.Kutrib, M. and Vollmar, R. The firing squad synchronization problem in defective cellular automata. IEICE Transactions on Information and Systems E78-D (1995), 895–900. 393Google Scholar
- 12.Mazoyer, J. Synchronization of a line of finite automata with nonuniform delays. Research Report TR 94-49, Ecole Normale Supérieure de Lyon, Lyon, 1994. 393Google Scholar
- 16.Umeo, H. A fault-tolerant scheme for optimum-time firing squad synchronization. Parallel Computing: Trends and Applications, 1994, 223–230. 393, 395Google Scholar
- 17.von Neumann, J. Probabilistic logics and the synthesis of reliable organisms from unreliable components. Automata Studies, Princeton University Press 34 (1956), 43–98. 392Google Scholar
- 18.Yunès, J.-B. Fault tolerant solutions to the firing squad synchronization problem. Technical Report LITP 96/06, Institut Blaise Pascal, Paris, 1996. 393Google Scholar