DocumentCode
3487475
Title
On synchronous strictly non-blocking concentrators and generalized-concentrators
Author
Dai, H.K.
Author_Institution
Dept. of Comput. Sci., North Dakota Univ., Grand Forks, ND, USA
fYear
1993
fDate
13-16 Apr 1993
Firstpage
406
Lastpage
412
Abstract
The optimal bound of (n -m +c )c +(m -c ) and an Ω(k (n -m +c )c 1/k ) lower bound on the size of synchronous strictly non-blocking c -limited (n ,m )-concentrators with depth 1 and depth k respectively are proved. A consequence of the lower-bound result is an Θ(n 1+1/k) bound on the size of synchronous strictly non-blocking fixed ratio γn -limited (αn ,βn )-concentrators (γ<β) with constant depth k . For synchronous strictly non-blocking (c ,r )-limited (n ,m )-generalized-concentrators, the optimal size of nc -[m-c/r](c -r ) for depth 1 and a lower bound size-depth tradeoff Ω((n -m /r+c/r)r k-1/k c 1/k) for constant depth k and r = o (c ) are also presented
Keywords
computational complexity; line concentrators; multiprocessor interconnection networks; generalized-concentrators; interconnection networks; lower bound; optimal bound; synchronous strictly nonblocking concentrators; Computer networks; Computer science; Concurrent computing; Connectors; Information resources; Integrated circuit interconnections; Mediation; Multiprocessor interconnection networks; Pattern analysis; Sorting;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing Symposium, 1993., Proceedings of Seventh International
Conference_Location
Newport, CA
Print_ISBN
0-8186-3442-1
Type
conf
DOI
10.1109/IPPS.1993.262917
Filename
262917
Link To Document