Gossiping on mesh-bus computers by packets

Satoshi Fujita, Masafumi Yamashita, Tadashi Ae

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

1 被引用数 (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 ℓ (≥ 1) tokens in a step. It is shown that by selecting the fastest algorithm among them, for each ℓ, a lower bound on the gossiping time can be attained asymptotically.

本文言語英語
ホスト出版物のタイトルProc Int Symp Parallel Archit Algorithms Networks ISPAN
出版社IEEE
ページ222-229
ページ数8
出版ステータス出版済み - 12 1 1994
イベントProceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN) - Kanazawa, Jpn
継続期間: 12 14 199412 16 1994

その他

その他Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)
CityKanazawa, Jpn
Period12/14/9412/16/94

All Science Journal Classification (ASJC) codes

  • コンピュータ サイエンス(全般)

フィンガープリント

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

引用スタイル