By Topic

Multi-node broadcasting in an arrangement graph using multiple spanning trees

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yuh-Shyan Chen ; Dept. of Comput. Sci. Inf. Eng., Chung-Hua Univ., Hsin-Chu, Taiwan ; Tong-Ying Juang ; Ying-Ying Shen

The arrangement graph An,k is not only a generalization of the star graph (n-k=1), but is also more flexible. Designing an efficient routing algorithm on a regular interconnection network is a fundamental issue for parallel processing techniques. We elucidate the multi-node broadcasting problem in an all-port communication model on the arrangement graph. Our routing strategy is proposed by construction of 2(n-k) spanning trees, where the height of each spanning tree is 2k-1. We also extend the routing strategy to a one-to-all broadcasting algorithm. Using 2(n-k) spanning trees allows us to present efficient (one/multi)- node broadcasting algorithms in the arrangement graph. The arrangement graph is assumed to use one-port and all-port models and packet-switching (or store-and forward) technique. Moreover we show that our (one/multi)-node broadcasting algorithms outperform previous results in the literature. This is justified by our performance analysis

Published in:

Parallel and Distributed Systems, 2000. Proceedings. Seventh International Conference on

Date of Conference: