论文信息 - Routing on the CAAPP

Routing on the CAAPP

A collection of routing algorithms for the content-addressable array parallel processor (CAAPP) which allow many more classes of interprocessor communication to be executed efficiently than otherwise on machines with conventional mesh-connected topologies is presented. It is shown that routing on the CAAPP can be executed with simplicity and performance similar to that of a dedicated routing network. Experimental results are presented from random permutations as well as from several common machine vision applications.<<ETX>>

[1] Massimo Maresca,et al. Polymorphic-Torus Network , 1989, IEEE Trans. Computers.

[2] Fillia Makedon,et al. A 2n−2 step algorithm for routing in ann ×n array with constant-size queues , 1995, SPAA '89.

[3] Russ Miller,et al. Meshes with reconfigurable buses , 1988 .

[4] Sartaj Sahni,et al. An optimal routing algorithm for mesh-connected Parallel computers , 1980, JACM.

[5] Leonard Kleinrock,et al. Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[6] Sartaj Sahni,et al. Bitonic Sort on a Mesh-Connected Parallel Computer , 1979, IEEE Transactions on Computers.

[7] William J. Dally,et al. Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[8] Ronald L. Graham,et al. An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[9] James J. Little,et al. Algorithmic Techniques for Computer Vision on a Fine-Grained Parallel Machine , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[10] Leslie G. Valiant,et al. Universal schemes for parallel communication , 1981, STOC '81.

[11] H. T. Kung,et al. Sorting on a mesh-connected parallel computer , 1977, CACM.