Overview and extensions of a system for routing directed graphs on SIMD architectures

A method is given for parallelizing the problems of directed graphs on a single-instruction multiple-data (SIMD) machine model that uses only nearest-neighbor connections for communication and has no facility for local indirect addressing. Each vertex of the graph is assigned to a processor in the machine. Rules for labeling are introduced that support the use of a simple algorithm for movement of data along the edges of the graph. Additional algorithms are defined for addition and deletion of edges. Modifying or adding a new edge takes the same time as parallel traversal. This combination of architecture and algorithm defines a system that is relatively simple to build and can do fast graph processing. All edges can be traversed in parallel in time O(T), where T is empirically proportional to the average path length in the embedding times the average degree of the graph. An extension to the above method is presented which allows for enhanced performance by allowing some broadcasting capabilities.<<ETX>>

[1]  Sartaj Sahni,et al.  Parallel Algorithms to Set Up the Benes Permutation Network , 1982, IEEE Transactions on Computers.

[2]  C. Y. Lee.  An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..

[3]  Sartaj Sahni,et al.  A Self-Routing Benes Network and Parallel Permutation Algorithms , 1981, IEEE Transactions on Computers.

[4]  Robert A. Wagner,et al.  The Boolean Vector Machine [BVM] , 1983, ISCA '83.

[5]  Kenneth E. Batcher,et al.  Design of a Massively Parallel Processor , 1980, IEEE Transactions on Computers.

[6]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[7]  Sartaj Sahni,et al.  Data broadcasting in SIMD computers , 1981, IEEE Transactions on Computers.

[8]  Thompson.  Generalized Connection Networks for Parallel Processor Intercommunication , 1978, IEEE Transactions on Computers.

[9]  Tse-yun Feng,et al.  A Survey of Interconnection Networks , 1981, Computer.

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

[11]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[12]  Sartaj Sahni,et al.  Parallel permutation and sorting algorithms and a new generalized connection network , 1982, JACM.

[13]  Frank Thomson Leighton,et al.  Parallel Computation Using Meshes of Trees , 1983, WG.

[14]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[15]  Sartaj Sahni,et al.  Optimal BPC Permutations on a Cube Connected SIMD Computer , 1982, IEEE Transactions on Computers.