Fast gossiping on square mesh computers

Satoshi Fujita, Masafumi Yamashita

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)


This paper considers the gossiping problem on square mesh computers under the following assumption: each node can send a token through each of the links incident on it in a step, but since each link can carry at most one token in one direction in a step (i.e., each link is half-duplex), either one of the two nodes connected by a link can send a token through it in a step. Under this assumption, we propose a gossiping algorithm for square mesh computers which asymptotically achieves the minimum gossiping time.

Original languageEnglish
Pages (from-to)127-130
Number of pages4
JournalInformation Processing Letters
Issue number3
Publication statusPublished - Nov 19 1993
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'Fast gossiping on square mesh computers'. Together they form a unique fingerprint.

Cite this