DocumentCode
1144165
Title
SIMD Machines and Cellular d-Graph Automata
Author
Wu, Angela Y. ; Rosenfeld, Azriel
Author_Institution
Computer Vision Laboratory, Computer Science Center, University of Maryland
Issue
5
fYear
1981
fDate
5/1/1981 12:00:00 AM
Firstpage
370
Lastpage
372
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.
Keywords
Cellular automata; SIMD machines; formal models; parallel processing; Automata; Computer graphics; Computer languages; Formal languages; Image processing; Power generation; Production; Transducers; Cellular automata; SIMD machines; formal models; parallel processing;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1981.1675798
Filename
1675798
Link To Document