Optimal Communication Algorithms for Hypercubes

@article{Bertsekas1991OptimalCA,
  title={Optimal Communication Algorithms for Hypercubes},
  author={Dimitri P. Bertsekas and C. {\"O}zveren and George D. Stamoulis and Paul Tseng and John N. Tsitsiklis},
  journal={J. Parallel Distrib. Comput.},
  year={1991},
  volume={11},
  pages={263-275}
}
We consider the following basic communication problems in a hypercube network of processors: the problem of a single processor sending a different packet to each of the other processors, the problem of simultaneous broadcast of the same packet from every processor to all other processors, and the problem of simultaneous exchange of different packets between every pair of processors. The algorithms proposed for these problems are optimal in terms of execution time and communication resource… CONTINUE READING
71 Extracted Citations
21 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.

Similar Papers

Loading similar papers…