Template matching with a MIMD computer

The authors examine the benefits of using highly parallel, general-purpose MIMD machines for image processing. They argue that for low-level image processing the only advantages are flexibility and ease of development, which are relatively unimportant in comparison to those of more efficient special-purpose hardware. In high-level image processing, however, parallel algorithms will, in general, require computer system features that are not satisfiable by special-purpose hardware or SIMD machines. Therefore, image processing applications for which the high-level part is the most time consuming can benefit the most from MIMD machines. For an optimally efficient implementation the authors recommend a hybrid approach. Reference throughout is made to the Distributed Object Oriented Machine (DOOM), and MIMD computer intended to exploit coarse-grain parallelism.<<ETX>>

[1]  J. M. Jansen,et al.  Parallel branch-and-bound algorithms , 1989, Future Gener. Comput. Syst..

[2]  David L. Waltz,et al.  Model-Based Object Recognition Using The Connection Machine , 1988, Other Conferences.

[3]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[4]  Wim Bronnenberg,et al.  DOOM: A Decentralized Object-Oriented Machine , 1987, IEEE Micro.