DocumentCode
2453014
Title
One to all broadcast in hyper butterfly networks
Author
Shi, Wei ; Srimani, Pradip K.
Author_Institution
Dept. of Comput. Sci., Colorado State Univ., Fort Collins, CO, USA
fYear
1998
fDate
17-20 Dec 1998
Firstpage
155
Lastpage
162
Abstract
The authors further investigate the topological properties of the hyper butterfly networks; they develop algorithms for constructing edge disjoint spanning trees in wrapped butterfly graphs and hyper butterfly networks and they use those results to design asymptotically optimal one-to-all broadcast algorithms in those two classes of networks
Keywords
hypercube networks; trees (mathematics); algorithms; asymptotically optimal one-to-all broadcast algorithm design; edge disjoint spanning trees; hyper butterfly networks; one to all broadcast; topological properties; wrapped butterfly graphs; Broadcasting; Computer science; Dairy products; Fault tolerance; Hypercubes; Intelligent networks; Multiprocessor interconnection networks; Parallel processing; Routing; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
High Performance Computing, 1998. HIPC '98. 5th International Conference On
Conference_Location
Madras
Print_ISBN
0-8186-9194-8
Type
conf
DOI
10.1109/HIPC.1998.737984
Filename
737984
Link To Document