This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
SIMD Machines and Cellular d-Graph Automata
May 1981 (vol. 30 no. 5)
pp. 370-372
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.
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
Usage of this product signifies your acceptance of the Terms of Use.