Search this article in Google Scholar


分類 国際会議
著者名 (author) Satoshi Fujita,Christian Laforest,Stephane Perennes
英文著者名 (author)
編者名 (editor)
編者名 (英文)
キー (key)
表題 (title) A Gossip Algorithm for Bus Networks with Buses of Limited Length
表題 (英文)
書籍・会議録表題 (booktitle) Euro-Par'96, Parallel Processing, Second International Euro-Par Conference, LNCS
書籍・会議録表題(英文)
巻数 (volume) 1123
号数 (number)
ページ範囲 (pages) 353-360
組織名 (organization)
出版元 (publisher)
出版元 (英文)
出版社住所 (address)
刊行月 (month) August
出版年 (year) 1996
付加情報 (note) Lyon
注釈 (annote) Acceptance rate: ??/383 = 31%, http://www.springerlink.com/content/7487452551783877/
内容梗概 (abstract) In this paper we consider the gossiping problem in bus networks in which any subset of vertices (i.e., nodes) of size ll, where l is a given constant greater than or equal to 2, is connected by a shared bus of length l. We call such a network complete bus network, since it is a generalization of complete point-to-point network K n . The proposed algorithm finishes a gossip in complete bus networks in a short time under a feasible and practical communication model. For example, it finishes a gossip only in 1.137 log2 n+O(1) steps for l=3.
論文電子ファイル Not available.


[1-72]  Satoshi Fujita, Christian Laforest, and Stephane Perennes, ``A Gossip Algorithm for Bus Networks with Buses of Limited Length,'' In Euro-Par'96, Parallel Processing, Second International Euro-Par Conference, LNCS, vol. 1123, pp. 353-360, August 1996. (Lyon)

@inproceedings{1_72,
    author = {Satoshi Fujita and Christian Laforest and Stephane Perennes},
    author_e = {},
    editor = {},
    editor_e = {},
    title = {A Gossip Algorithm for Bus Networks with Buses of Limited Length},
    title_e = {},
    booktitle = {Euro-Par'96, Parallel Processing, Second International Euro-Par
    Conference, LNCS},
    booktitle_e = {},
    volume = {1123},
    number = {},
    pages = {353-360},
    organization = {},
    publisher = {},
    publisher_e = {},
    address = {},
    month = {August},
    year = {1996},
    note = {Lyon},
    annote = {Acceptance rate: ??/383 = 31%, http://www.springerlink.com/
    content/7487452551783877/}
}

This site is maintained by Distributed System Laboratory.

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