Fast gossiping on square mesh computers

Satoshi Fujita, Masafumi Yamashita

研究成果: Contribution to journalArticle査読

6 被引用数 (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.

本文言語英語
ページ(範囲)127-130
ページ数4
ジャーナルInformation Processing Letters
48
3
DOI
出版ステータス出版済み - 11 19 1993

All Science Journal Classification (ASJC) codes

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

フィンガープリント 「Fast gossiping on square mesh computers」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル