The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1981 vol.30)
pp: 370-372
A.Y. Wu , Computer Vision Laboratory, Computer Science Center, University of Maryland
ABSTRACT
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.
INDEX TERMS
SIMD machines, Cellular automata, formal models, parallel processing
CITATION
A.Y. Wu, A. Rosenfeld, "SIMD Machines and Cellular d-Graph Automata", IEEE Transactions on Computers, vol.30, no. 5, pp. 370-372, May 1981, doi:10.1109/TC.1981.1675798
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool