A routing algorithm for PEC networks
C.-C. Lin, Viktor K. Prasanna · 2003
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.>