A routing algorithm for PEC networks

A routing algorithm is shown which can route in O( square root log N*2/sup square root 2logN/) steps in an N node packed exponential connections (PEC) network. It is also shown that semigroup operations can be performed in O(log N*2/sup square root 2logN/) parallel steps.<<ETX>>

[1]  David A. Carlson,et al.  Performing Tree and Prefix Computations on Modified Mesh-Connected Parallel Computers , 1985, ICPP.

[2]  J. P. Gray,et al.  Configurable hardware: a new paradigm for computation , 1989 .

[3]  W. W. Kirkman.  The Digital Transform Machine , 1990, [1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation.

[4]  W. Worth Kirkman,et al.  Packed exponential connections-a hierarchy of 2-D meshes , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.