Search this article in Google Scholar


分類 国際会議
著者名 (author) Satoshi Fujita,Masafumi Yamashita,Tadashi Ae
英文著者名 (author)
編者名 (editor)
編者名 (英文)
キー (key)
表題 (title) Optimal Group Gossiping in Hypercubes under Wormhole Routing Model
表題 (英文)
書籍・会議録表題 (booktitle) Algorithms and Computation, 4th International Symposium, ISAAC '93, LNCS
書籍・会議録表題(英文)
巻数 (volume) 762
号数 (number)
ページ範囲 (pages) 277-286
組織名 (organization)
出版元 (publisher)
出版元 (英文)
出版社住所 (address)
刊行月 (month) December
出版年 (year) 1993
付加情報 (note) Hong Kong
注釈 (annote) Acceptance rate: 54/200(?) = 27%, http://www.springerlink.com/content/p64m7115387634pj/
内容梗概 (abstract) This paper introduces a new gossiping problem of exchanging tokens among specified nodes. We call this problem the group gossiping problem. The group gossiping problem is a generalization of the usual gossiping problem, which has been investigated extensively during the last decade. In this paper, we consider the gossiping problem in n-cubes under the wormhole routing model, which is a model of the communication by the wormhole switching. We propose an asymptotically optimal group gossiping algorithm for n-cubes under the model.
論文電子ファイル Not available.


[1-67]  Satoshi Fujita, Masafumi Yamashita, and Tadashi Ae, ``Optimal Group Gossiping in Hypercubes under Wormhole Routing Model,'' In Algorithms and Computation, 4th International Symposium, ISAAC '93, LNCS, vol. 762, pp. 277-286, December 1993. (Hong Kong)

@inproceedings{1_67,
    author = {Satoshi Fujita and Masafumi Yamashita and Tadashi Ae},
    author_e = {},
    editor = {},
    editor_e = {},
    title = {Optimal Group Gossiping in Hypercubes under Wormhole Routing Model},
    
    title_e = {},
    booktitle = {Algorithms and Computation, 4th International Symposium, ISAAC
    '93, LNCS},
    booktitle_e = {},
    volume = {762},
    number = {},
    pages = {277-286},
    organization = {},
    publisher = {},
    publisher_e = {},
    address = {},
    month = {December},
    year = {1993},
    note = {Hong Kong},
    annote = {Acceptance rate: 54/200(?) = 27%, http://www.springerlink.com/
    content/p64m7115387634pj/}
}

This site is maintained by Distributed System Laboratory.

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