Search this article in Google Scholar


分類 国際会議
著者名 (author) Satoshi Fujita,Masafumi Yamashita,Tadashi Ae
英文著者名 (author)
編者名 (editor)
編者名 (英文)
キー (key)
表題 (title) Gossiping on Mesh-Bus Computers by Packets
表題 (英文)
書籍・会議録表題 (booktitle) Proc. the International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN 1994)
書籍・会議録表題(英文)
巻数 (volume)
号数 (number)
ページ範囲 (pages)
組織名 (organization)
出版元 (publisher)
出版元 (英文)
出版社住所 (address)
刊行月 (month) December
出版年 (year) 1994
付加情報 (note) Kanazawa
注釈 (annote) DOI: 10.1109/ISPAN.1994.367143, Acceptance rate: 48/110 = 44%
内容梗概 (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 l(⩾1) tokens in a step. It is shown that by selecting the fastest algorithm among them, for each l, a lower bound on the gossiping time can be attained asymptotically.
論文電子ファイル Not available.


[1-70]  Satoshi Fujita, Masafumi Yamashita, and Tadashi Ae, ``Gossiping on Mesh-Bus Computers by Packets,'' In Proc. the International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN 1994), December 1994. (Kanazawa)

@inproceedings{1_70,
    author = {Satoshi Fujita and Masafumi Yamashita and Tadashi Ae},
    author_e = {},
    editor = {},
    editor_e = {},
    title = {Gossiping on Mesh-Bus Computers by Packets},
    title_e = {},
    booktitle = {Proc. the International Symposium on Parallel Architectures,
    Algorithms and Networks (I-SPAN 1994)},
    booktitle_e = {},
    volume = {},
    number = {},
    pages = {},
    organization = {},
    publisher = {},
    publisher_e = {},
    address = {},
    month = {December},
    year = {1994},
    note = {Kanazawa},
    annote = {DOI: 10.1109/ISPAN.1994.367143, Acceptance rate: 48/110 = 44%}
}

This site is maintained by Distributed System Laboratory.

PMAN 2.5.5 - Paper MANagement system / (C) 2002-2008, Osamu Mizuno / All rights reserved.