Fast gossiping on mesh-bus computers

Satoshi Fujita, Masafumi Yamashita

研究成果: Contribution to journalArticle査読

7 被引用数 (Scopus)

抄録

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.

本文言語英語
ページ(範囲)1326-1330
ページ数5
ジャーナルIEEE Transactions on Computers
45
11
DOI
出版ステータス出版済み - 12 1 1996

All Science Journal Classification (ASJC) codes

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

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

引用スタイル