This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Symmetric Tree Structure Interconnection Network and its Message Traffic
August 1985 (vol. 34 no. 8)
pp. 765-769
null Nam Sung Woo, AT&T Bell Laboratories
A variation of the tree structure interconnection network for the message switching multiprocessor system is presented in this correspondence. It mainly consists of four binary tree structures, pairs of which are touched by their leaf nodes; in addition, there are four nodes which interface with external environments. The proposed network is left-right and top-down symmetric and is planar. Every node in the interconnection network has the same number of degree, 3. There are multiple paths between any two nodes in the network. Results of the message traffic analysis of the network are presented.
Index Terms:
top-down/left-right symmetric tree structure, Extended even-odd node numbering, interconnection network for VLSI implementation, message traffic analysis
Citation:
null Nam Sung Woo, A. Agrawala, "A Symmetric Tree Structure Interconnection Network and its Message Traffic," IEEE Transactions on Computers, vol. 34, no. 8, pp. 765-769, Aug. 1985, doi:10.1109/TC.1985.1676626
Usage of this product signifies your acceptance of the Terms of Use.