EFFICIENT MAPPING ALGORITHMS FOR A CLASS OF HIERARCHICAL SYSTEMS

This paper proposes techniques for mapping application algorithms onto a class of hierarchically structured parallel computing systems. Mult iprocessors of this type are capable of efficiently solving a variety of scientific problems because they can efficiently implement both loc al and global operations for data in a two-dimensional array format. A mong the set of candidate application domains, low-level and intermedi ate-level image processing and computer vision (IPCV) are characterize d by high-performance requirements. Emphasis is given in this paper to IPCV algorithms. The importance of the mapping techniques stems from the fact that the current technology cannot be used to build cost-effe ctive and efficient systems composed of very large numbers of processo rs, so the performance of various systems of lower cost should be inve stigated. Both analytical and simulation results prove the effectivene ss and efficiency of the proposed mapping techniques.