Optimal group gossiping in hypercubes under a circuit-switching model

Satoshi Fujita, Masafumi Yamashita

Research output: Contribution to journalArticle

9 Citations (Scopus)

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 languageEnglish
Pages (from-to)1045-1060
Number of pages16
JournalSIAM Journal on Computing
Volume25
Issue number5
DOIs
Publication statusPublished - Jan 1 1996

Fingerprint

Circuit Switching
Gossiping
Switching circuits
Hypercube
Broadcasting
N-cube
Computer systems
Vertex of a graph
Model
Parallel Computers

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Mathematics(all)

Cite this

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

In: SIAM Journal on Computing, Vol. 25, No. 5, 01.01.1996, p. 1045-1060.

Research output: Contribution to journalArticle

Fujita, Satoshi ; Yamashita, Masafumi. / Optimal group gossiping in hypercubes under a circuit-switching model. In: SIAM Journal on Computing. 1996 ; Vol. 25, No. 5. pp. 1045-1060.
@article{784c61ea9d2d4fa0a6533aa662f99084,
title = "Optimal group gossiping in hypercubes under a circuit-switching model",
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.",
author = "Satoshi Fujita and Masafumi Yamashita",
year = "1996",
month = "1",
day = "1",
doi = "10.1137/S0097539793252870",
language = "English",
volume = "25",
pages = "1045--1060",
journal = "SIAM Journal on Computing",
issn = "0097-5397",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "5",

}

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 -