Issue No. 05 - May (1981 vol. 30)
A.Y. Wu , Computer Vision Laboratory, Computer Science Center, University of Maryland
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.
SIMD machines, Cellular automata, formal models, parallel processing
A. Wu and A. Rosenfeld, "SIMD Machines and Cellular d-Graph Automata," in IEEE Transactions on Computers, vol. 30, no. , pp. 370-372, 1981.