Gossiping in the Multicasting Communication Environment
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
An Efficient Algorithm for Gossiping in the Multicasting Communication Environment
IEEE Transactions on Parallel and Distributed Systems
On the communication surplus incurred by faulty processors
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
Let $U$ be a given set of nodes of a parallel computer system and assume that each node $u$ in $U$ has a piece of information $t(u)$ called a token. This paper discusses the problem of each $u\in U$ broadcasting its token $t(u)$ to all nodes in $U$. We refer to this problem as the group-gossiping problem, which includes the (conventional) gossiping problem as a special case. In this paper, we consider the group-gossiping problem in $n$-cubes under a circuit-switching model and propose an optimal group-gossiping algorithm for $n$-cubes under the model.