I. Korn. "On (d; k) Graphs". IEEE Transactions on Electronic Computers, Vol. EC-16, p. 90, February 1967. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Interconnection Topologies and Routing for Parallel Processing.. - Kotsis (Correct)
....to indicate that the real order of magnitude is larger than the given one, and a to indicate that the real order of magnitude is smaller. reference to order of dependence for literature N L K KG(b;n) Kaut 68] b(b Gamma 1) n Gamma1 if b varies N p N fix if n varies N log N KT (d; h) Korn 67] 2(2B h 1 Gamma(B 1) B Gamma1 if d varies N p N fix if h varies N log N L(N ) N N N M (W; n) W n if W varies N N 1=n if n varies N log N log N MDMW (N ) Beiv 87] b(2b Gamma h) N p N=2 MG(n) Lela 82] 2 n N log N MQ(n) Efe 88] 2 n N log N log N 2 MTS(m;B;h) Arde 78] ....
I. Korn. "On (d; k) Graphs". IEEE Transactions on Electronic Computers, Vol. EC-16, p. 90, February 1967.
Interconnection Topologies and Routing for Parallel Processing.. - Kotsis (1992) (Correct)
....A node receiving a message has to decide whether the destination node is in the same component tree or not. If so, then ordinary tree routing takes place (see Section 3.1) Otherwise the message has to be sent downwards to the leaves and then to the destination component tree. K tree KT(B;h) Korn 67] K trees are based on the idea of Friedman with the only difference that maximum 2 rooted trees are used. Definition 44 A K tree, denoted by KT (B; h) combines B 1 copies of a T 2;max (B; h) by merging their leaf nodes. The total number of nodes is given by N = 2(2B h 1 Gamma (B 1) B ....
.... 88] R2 n Gamma1 if R varies N N if n varies N log N log N HC(W;n) 29 [Hawk 85] W n if W varies N p N fix if n varies N log N log N HT (h) 35 [Good 81] 2 h N log N K(N ) 20 N N 2 fix KG(b;n) 23 [Kaut 68] b(b Gamma 1) n Gamma1 if b varies N p N fix if n varies N log N KT (d; h) 44 [Korn 67] 2(2B h 1 Gamma(B 1) B Gamma1 if d varies N p N fix if h varies N log N Table 4.1: Connection costs and Communicaton delays (1) reference to order of dependence for page literature N L K L(N ) 19 N N N M (W; n) 29 W n if W varies N N 1=n if n varies N log N log N MDMW (N ) 38 ....
[Article contains additional citation context not shown here]
I. Korn. "On (d; k) Graphs". IEEE Transactions on Electronic Computers, Vol. EC-16, p. 90, February 1967.
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