This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Internode Communications in Reconfigurable Binary Trees
November 1984 (vol. 33 no. 11)
pp. 977-990
S.P. Kartashev, University of Nebraska at Lincoln, Lincoln, NE 68508, and Dynamic Computer Architecture, Inc.
This paper discusses efficient communication algorithms for multicomputer networks organized as reconfigurable binary trees.
Index Terms:
reconfigurable binary trees, Efficient internode communications, multicomputer networks
Citation:
S.P. Kartashev, S.I. Kartashev, "Efficient Internode Communications in Reconfigurable Binary Trees," IEEE Transactions on Computers, vol. 33, no. 11, pp. 977-990, Nov. 1984, doi:10.1109/TC.1984.1676372
Usage of this product signifies your acceptance of the Terms of Use.