[Previous [1] [2] [3] [4] [5] [6] [7] [8] [9] [10]

Journal of Inforamtion Science and Engineering, Vol.14 No.4, pp.809-820 (December 1998)
Multi-Node Broadcasting
in Hypercubes and Star Graphs1

Yu-Chee Tseng
 Department of Computer Science and Information Engineering
National Central University
Chungli, Taiwan 320, R. O. C.

In a hypercube or a star graph, given an unknown number of nodes located at unknown positions each intending to broadcast a message, we propose an efficient routing algorithm to solve this problem using asymptotically optimal or near-optimal transmission time.

Keywords: collective communication, hypercube, interconnection network, many-to-all roadcasting, parallel architecture, routing, star graph

Full Text (¥þ¤åÀÉ) Retrieve PDF document (199812_06.pdf : 178,292 bytes)

Received October 22, 1997; revised May 11, 1998; accepted June 8, 1998.
Communicated by Wen-Lien Hsu.
1 This research was wupported in part by the National Science Council of the Republic of China under Grant No. NSC 87-2213-E-008-012 and Grant No. NSC87-2213-E-008-016.