DocumentCode
3297018
Title
A routing algorithm for PEC networks
Author
Lin, Cho-Chin ; Prasanna, Viktor K.
Author_Institution
Univ. of Southern California, Los Angeles, CA, USA
fYear
1992
fDate
19-21 Oct 1992
Firstpage
170
Lastpage
177
Abstract
A routing algorithm is shown which can route in O (√log N ×2√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√2logN) parallel steps
Keywords
multiprocessor interconnection networks; parallel algorithms; PEC networks; packed exponential connections network; routing algorithm; semigroup operations; Contracts; Joining processes; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Frontiers of Massively Parallel Computation, 1992., Fourth Symposium on the
Conference_Location
McLean, VA
Print_ISBN
0-8186-2772-7
Type
conf
DOI
10.1109/FMPC.1992.234891
Filename
234891
Link To Document