Broadcasting Multiple Messages Using Cycle-Rooted Trees

Author

Irino, Hiroaki ; Tanaka, Yuuki ; Kawai, Hiroyuki ; Osawa, Shingo ; Shibata, Yukio

Author_Institution

Fast Corp., Yamato, Japan

fYear

2009

fDate

8-11 Dec. 2009

Firstpage

524

Lastpage

529

Abstract

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.

Keywords

broadcasting; directed graphs; message passing; parallel processing; cycle-rooted trees; de Bruijn digraph; distributed computing; gossiping problem; information dissemination problem; interconnection networks; multiple message broadcasting; multisource broadcasting problem; parallel computing; Application software; Broadcast technology; Broadcasting; Computer science; Distributed computing; Educational institutions; Information science; Multiprocessor interconnection networks; Network topology; Relays; Cycle-rooted tree; Information dissemination; Multi-source broadcast; de Bruijn digraph;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Computing, Applications and Technologies, 2009 International Conference on

Conference_Location

Higashi Hiroshima

Print_ISBN

978-0-7695-3914-0

Type

conf

DOI

10.1109/PDCAT.2009.43

Filename

5372750