Issue No. 05 - May (1997 vol. 46)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.589231
<p><b>Abstract</b>—In a multicomputer network, sending a packet typically incurs two costs: start-up time and transmission time. This work is motivated by the observation that most broadcast algorithms in the literature for the star graph networks only try to minimize one of the costs. Thus, many algorithms, though claimed to be optimal, are only so when one of the costs is negligible. In this paper, we try to optimize both costs simultaneously for four types of broadcast problems: <it>one-to-all</it> or <it>all-to-all</it> broadcasting in an <it>n</it>-star network with either <it>one-port</it> or <it>all-port</it> communication capability. As opposed to earlier solutions, the main technique used in this paper is to construct from a source node multiple spanning trees, along each of which one partition of the broadcast message is transmitted.</p>
All-to-all broadcast, collective communication, multi-computer networks, one-to-all broadcast, parallel architecture, routing, star graph.
Jang-Ping Sheu, Yu-Chee Tseng, "Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees", IEEE Transactions on Computers, vol. 46, no. , pp. 593-599, May 1997, doi:10.1109/12.589231