General Routing on the Lowest Level of the Image Understanding Architecture

SIMD mesh connected computers have been found to be very useful in many applications , such as those often found in image processing and matrix arithmetic, where the communication among PEs is local, regular, or both. Low eeciency results, however , when the communication patterns are irregular or sparse, a situation we have found to exist in many computer vision applications. This paper describes a routing primitive which makes signiicant progress towards solving that problem for the CAAPP, a SIMD mesh connected computer enhanced with the broadcast capability of the coterie network. We show that general routing on the CAAPP can be executed with simplicity to the user and performance similar to that of a dedicated network. We present experimental results from several classes of permutations as well as from some common machine vision applications.