### 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 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Computer Science(all)
- Mathematics(all)

### Cite this

*SIAM Journal on Computing*,

*25*(5), 1045-1060. https://doi.org/10.1137/S0097539793252870

**Optimal group gossiping in hypercubes under a circuit-switching model.** / Fujita, Satoshi; Yamashita, Masafumi.

Research output: Contribution to journal › Article

*SIAM Journal on Computing*, vol. 25, no. 5, pp. 1045-1060. https://doi.org/10.1137/S0097539793252870

}

TY - JOUR

T1 - Optimal group gossiping in hypercubes under a circuit-switching model

AU - Fujita, Satoshi

AU - Yamashita, Masafumi

PY - 1996/1/1

Y1 - 1996/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0041571965&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0041571965&partnerID=8YFLogxK

U2 - 10.1137/S0097539793252870

DO - 10.1137/S0097539793252870

M3 - Article

AN - SCOPUS:0041571965

VL - 25

SP - 1045

EP - 1060

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 5

ER -