论文信息 - SIMD Machines and Cellular d-Graph Automata - 字舞流文

SIMD Machines and Cellular d-Graph Automata

A formal model for processor networks, the cellular d-graph automaton, is described, and its equivalence to Siegel's formal model for SIMD machines is discussed.

Azriel Rosenfeld | Angela Y. Wu

[1] D. M. Watson,et al. The Cellular Logic Array Image Processor , 1977, Comput. J..

[2] Sheila A. Greibach,et al. Checking Automata and One-Way Stack Languages , 1969, J. Comput. Syst. Sci..

[3] Daniel J. Rosenkrantz,et al. Programmed Grammars and Classes of Formal Languages , 1969, JACM.

[4] Azriel Rosenfeld,et al. Local Reconfiguration of Networks of Processors: Arrays, Trees, and Graphs. , 1979 .

[5] Howard Jay Siegel,et al. A Model of SIMD Machines and a Comparison of Various Interconnection Networks , 1979, IEEE Transactions on Computers.

[6] Curtis R. Cook,et al. First Order Graph Grammars , 1974, SIAM J. Comput..

[7] C. Cook,et al. A chomsky hierarchy of isotonic array grammars and languages , 1978 .

[8] Azriel Rosenfeld,et al. Parallel / Sequential Array Automata , 1973, Inf. Process. Lett..

[9] Azriel Rosenfeld,et al. Reconfigurable Cellular Computers , 1981, Inf. Control..

[10] Rani Siromoney,et al. Array automata and operations on array languages , 1974 .

[11] Azriel Rosenfeld,et al. Local Reconfiguration of Networks of Processors. , 1979 .

[12] Rani Siromoney,et al. Parallel/sequential rectangular arrays with tables , 1977 .

[13] Rani Siromoney. Finite-Turn Checking Automata , 1971, J. Comput. Syst. Sci..

[14] Azriel Rosenfeld,et al. Cellular Graph Automata. I. Basic Concepts, Graph Property Measurement, Closure Properties , 1979, Inf. Control..