Gossiping on mesh-bus computers by packets

Satoshi Fujita, Masafumi Yamashita, Tadashi Ae

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (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 ℓ (≥ 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.

Original languageEnglish
Title of host publicationProc Int Symp Parallel Archit Algorithms Networks ISPAN
PublisherIEEE
Pages222-229
Number of pages8
Publication statusPublished - Dec 1 1994
EventProceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN) - Kanazawa, Jpn
Duration: Dec 14 1994Dec 16 1994

Other

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

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Gossiping on mesh-bus computers by packets'. Together they form a unique fingerprint.

  • Cite this

    Fujita, S., Yamashita, M., & Ae, T. (1994). Gossiping on mesh-bus computers by packets. In Proc Int Symp Parallel Archit Algorithms Networks ISPAN (pp. 222-229). IEEE.