The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (1984 vol.33)
pp: 977-990
S.P. Kartashev , University of Nebraska at Lincoln, Lincoln, NE 68508, and Dynamic Computer Architecture, Inc.
ABSTRACT
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, November 1984, doi:10.1109/TC.1984.1676372
24 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool