SIMD Machines and Cellular d-Graph Automata

  • Authors:

  • A. Y. Wu;A. Rosenfeld

  • Affiliations:

  • Computer Vision Laboratory, Computer Science Center, University of Maryland;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1981

Quantified Score

Hi-index 14.98

Visualization

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.