Abstract
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 ∈ 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.
| Original language | English |
|---|---|
| Pages (from-to) | 1045-1060 |
| Number of pages | 16 |
| Journal | SIAM Journal on Computing |
| Volume | 25 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - Jan 1 1996 |
All Science Journal Classification (ASJC) codes
- Computer Science(all)
- Mathematics(all)