Efficient Internode Communications in Reconfigurable Binary Trees

  • Authors:
  • S. P. Kartashev;S. I. Kartashev

  • Affiliations:
  • University of Nebraska at Lincoln, Lincoln, NE 68508, and Dynamic Computer Architecture, Inc.;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1984

Quantified Score

Hi-index 14.99

Visualization

Abstract

This paper discusses efficient communication algorithms for multicomputer networks organized as reconfigurable binary trees.