Broadcasting Multiple Messages in Hypercubes (preliminary version)

  • Authors:

  • A. Liestman;T. Shermer;M. Suderman

  • Affiliations:

  • -;-;-

  • Venue:
  • ISPAN '00 Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

We investigate T, (Qd), the time required to broadcastm\geq 1 messages in a d-dimensional hypercube under thetelephone model. We give exact values for Tm(Qd) form \leq 2d-1 and for m \geq 2d + 1. For 2d-1- + 1\leq m \leq 2d,we produce an upper bound which is 1 larger than the lowerbound. One consequence of our results is to disprove alower bound due to Farley [3].