| A. Bar-Noy, S. Kipnis, and B. Schieber. Optimal multiple message broadcasting in telephone-like communication systems. Discrete Applied Mathematics, 100(1-2):1--15, 2000. |
.... decompositions of the complete graph into permutations that can be efficiently executed on mesh like networks [11, 5] for gossiping [14] and for all to all communication on fully connected networks [10] Our variant of the single ported communication model is similar to the telephone model [2, 1]. Collective communication on hierarchical systems has recently received some attention [12, 8, 7] Huse [7] reports experiments with an implementation of a regular all to all algorithm which ensures that only one processor per node is involved in inter node communication at a time. Algorithmic ....
Bar-Noy, Kipnis, and Schieber. Optimal multiple message broadcasting in telephone-like communication systems. DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, 100:1-- 15, 2000.
No context found.
A. Bar-Noy, S. Kipnis, and B. Schieber. Optimal multiple message broadcasting in telephone-like communication systems. Discrete Applied Mathematics, 100(1-2):1--15, 2000.
No context found.
A. Bar-Noy, S. Kipnis, and B. Schieber. Optimal multiple message broadcasting in telephone-like communication systems. Discrete Applied Mathematics, 100(1-2):1--15, 2000.
No context found.
A. Bar-Noy, S. Kipnis, and B. Schieber. Optimal multiple message broadcasting in telephone-like communication systems. Discrete Applied Mathematics, (100):1--15, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC