|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2009 International Conference on Parallel and Distributed Computing, Applications and Technologies
Broadcasting Multiple Messages Using Cycle-Rooted Trees
Higashi Hiroshima, Japan
December 08-December 11
ISBN: 978-0-7695-3914-0
| ASCII Text | x | ||
| Hiroaki Irino, Yuuki Tanaka, Hiroyuki Kawai, Shingo Osawa, Yukio Shibata, "Broadcasting Multiple Messages Using Cycle-Rooted Trees," Parallel and Distributed Computing Applications and Technologies, International Conference on, pp. 524-529, 2009 International Conference on Parallel and Distributed Computing, Applications and Technologies, 2009. | |||
| BibTex | x | ||
| @article{ 10.1109/PDCAT.2009.43, author = {Hiroaki Irino and Yuuki Tanaka and Hiroyuki Kawai and Shingo Osawa and Yukio Shibata}, title = {Broadcasting Multiple Messages Using Cycle-Rooted Trees}, journal ={Parallel and Distributed Computing Applications and Technologies, International Conference on}, volume = {0}, year = {2009}, isbn = {978-0-7695-3914-0}, pages = {524-529}, doi = {http://doi.ieeecomputersociety.org/10.1109/PDCAT.2009.43}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Parallel and Distributed Computing Applications and Technologies, International Conference on TI - Broadcasting Multiple Messages Using Cycle-Rooted Trees SN - 978-0-7695-3914-0 SP524 EP529 A1 - Hiroaki Irino, A1 - Yuuki Tanaka, A1 - Hiroyuki Kawai, A1 - Shingo Osawa, A1 - Yukio Shibata, PY - 2009 KW - Information dissemination KW - Multi-source broadcast KW - de Bruijn digraph KW - Cycle-rooted tree VL - 0 JA - Parallel and Distributed Computing Applications and Technologies, International Conference on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDCAT.2009.43
In information dissemination problem on interconnection networks, problems of broadcasting and gossiping have been widely studied. In this paper, we study the other problem, called multi-source broadcasting, defined as follows: there are some (but not all) vertices each of which has the unique item of information and needs to disseminate to every other vertex. This problem is located at an intermediate position between broadcasting and gossiping. We analyze the multi-source broadcasting problem on the cycle-rooted tree and the de Bruijn digraph as an interconnection network.
Index Terms:
Information dissemination, Multi-source broadcast, de Bruijn digraph, Cycle-rooted tree
Citation:
Hiroaki Irino, Yuuki Tanaka, Hiroyuki Kawai, Shingo Osawa, Yukio Shibata, "Broadcasting Multiple Messages Using Cycle-Rooted Trees," pdcat, pp.524-529, 2009 International Conference on Parallel and Distributed Computing, Applications and Technologies, 2009
Usage of this product signifies your acceptance of the Terms of Use.