Fast gossiping on mesh-bus computers

Satoshi Fujita, Masafumi Yamashita

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

A mesh-bus computer is a parallel computer in which nodes (i.e., processors) are arranged on a two-dimensional array, and nodes on each row and nodes on each column, respectively, are connected by a shared bus. The nodes communicate with each other by exchanging packets through shared buses in CREW manner. Suppose that each node initially contains a piece of information called a token. A gossiping problem is the routing problem of exchanging tokens among all nodes in the computer, which has been studied extensively as a basic communication scheme for sharing information among nodes in a parallel computer. In this paper, we propose three gossiping algorithms for mesh-bus computers assuming that each packet can carry at most ℓ tokens in a step, where ℓ is a function of the number of all nodes. It is shown that by selecting the fastest algorithm among them, for each given function ℓ, a lower bound on the gossiping time can be attained asymptotically.

Original languageEnglish
Pages (from-to)1326-1330
Number of pages5
JournalIEEE Transactions on Computers
Volume45
Issue number11
DOIs
Publication statusPublished - Dec 1 1996

Fingerprint

Gossiping
Mesh
Vertex of a graph
Parallel Computers
Information Sharing
Routing Problem
Fast Algorithm
Communication
Lower bound

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Software
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

Fast gossiping on mesh-bus computers. / Fujita, Satoshi; Yamashita, Masafumi.

In: IEEE Transactions on Computers, Vol. 45, No. 11, 01.12.1996, p. 1326-1330.

Research output: Contribution to journalArticle

Fujita, S & Yamashita, M 1996, 'Fast gossiping on mesh-bus computers', IEEE Transactions on Computers, vol. 45, no. 11, pp. 1326-1330. https://doi.org/10.1109/12.544491
Fujita, Satoshi ; Yamashita, Masafumi. / Fast gossiping on mesh-bus computers. In: IEEE Transactions on Computers. 1996 ; Vol. 45, No. 11. pp. 1326-1330.
@article{1321e3327a054dac977e7c2b03799e57,
title = "Fast gossiping on mesh-bus computers",
abstract = "A mesh-bus computer is a parallel computer in which nodes (i.e., processors) are arranged on a two-dimensional array, and nodes on each row and nodes on each column, respectively, are connected by a shared bus. The nodes communicate with each other by exchanging packets through shared buses in CREW manner. Suppose that each node initially contains a piece of information called a token. A gossiping problem is the routing problem of exchanging tokens among all nodes in the computer, which has been studied extensively as a basic communication scheme for sharing information among nodes in a parallel computer. In this paper, we propose three gossiping algorithms for mesh-bus computers assuming that each packet can carry at most ℓ tokens in a step, where ℓ is a function of the number of all nodes. It is shown that by selecting the fastest algorithm among them, for each given function ℓ, a lower bound on the gossiping time can be attained asymptotically.",
author = "Satoshi Fujita and Masafumi Yamashita",
year = "1996",
month = "12",
day = "1",
doi = "10.1109/12.544491",
language = "English",
volume = "45",
pages = "1326--1330",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "11",

}

TY - JOUR

T1 - Fast gossiping on mesh-bus computers

AU - Fujita, Satoshi

AU - Yamashita, Masafumi

PY - 1996/12/1

Y1 - 1996/12/1

N2 - A mesh-bus computer is a parallel computer in which nodes (i.e., processors) are arranged on a two-dimensional array, and nodes on each row and nodes on each column, respectively, are connected by a shared bus. The nodes communicate with each other by exchanging packets through shared buses in CREW manner. Suppose that each node initially contains a piece of information called a token. A gossiping problem is the routing problem of exchanging tokens among all nodes in the computer, which has been studied extensively as a basic communication scheme for sharing information among nodes in a parallel computer. In this paper, we propose three gossiping algorithms for mesh-bus computers assuming that each packet can carry at most ℓ tokens in a step, where ℓ is a function of the number of all nodes. It is shown that by selecting the fastest algorithm among them, for each given function ℓ, a lower bound on the gossiping time can be attained asymptotically.

AB - A mesh-bus computer is a parallel computer in which nodes (i.e., processors) are arranged on a two-dimensional array, and nodes on each row and nodes on each column, respectively, are connected by a shared bus. The nodes communicate with each other by exchanging packets through shared buses in CREW manner. Suppose that each node initially contains a piece of information called a token. A gossiping problem is the routing problem of exchanging tokens among all nodes in the computer, which has been studied extensively as a basic communication scheme for sharing information among nodes in a parallel computer. In this paper, we propose three gossiping algorithms for mesh-bus computers assuming that each packet can carry at most ℓ tokens in a step, where ℓ is a function of the number of all nodes. It is shown that by selecting the fastest algorithm among them, for each given function ℓ, a lower bound on the gossiping time can be attained asymptotically.

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

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

U2 - 10.1109/12.544491

DO - 10.1109/12.544491

M3 - Article

AN - SCOPUS:0030283485

VL - 45

SP - 1326

EP - 1330

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 11

ER -