B. Ramkumar and L. V. Kale. "D-Trees: A Class of Dense Regular Interconnection Topologies". In: Frontiers '88, The 2nd Symposium on the Frontiers of Massively Parallel Computation, pp. 207--210, IEEE, 1988.  Home/Search   Document Not in Database   Summary   Related Articles

.... N BQ(n; s) Yous 90] n 1)s n if n varies N log N log N if s varies N p N fix BSG(n) Aker 84] n N fix C(N ) N N N C1(d; m) Memm 82] m(d=2) m Gamma1 if d varies N p N fix if m varies N log N CCC(n) Prep 81] n2 n N logN CR(w) Arde 81] N even N p N DT m (B; h; p; K) Ramk 88] p (B 1)B h Gamma2 B Gamma1 if B varies N p N fix if h varies N log N DCR(w 1 ; w 2 ) Yang 88] N even N p N ECR(W ) Doty 82] N N p N FQ(n) El A 91] 2 n log 2 N log 2 (N=2) FT (d; h) Frie 66] 2(B 1) B h Gamma1) B Gamma1 if d varies N p N fix if h varies N log N GCR(W ) ....

B. Ramkumar and L. V. Kale. "D-Trees: A Class of Dense Regular Interconnection Topologies". In: Frontiers '88, The 2nd Symposium on the Frontiers of Massively Parallel Computation, pp. 207--210, IEEE, 1988.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC