By Topic

Complete exchange algorithms in wormhole-routed torus networks : a divide-and-conquer strategy

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)
Si-Gwan Kim ; Dept. of Comput. Sci., Korea Adv. Inst. of Sci. & Technol., Seoul, South Korea ; Seung Ryoul Maeng ; Jung Wan Cho

We present efficient all-to-all personalized communication algorithms for a 2D torus in wormhole-routed networks. Our complete exchange algorithm adopts divide-and-conquer approach to reduce the start-up latency significantly, which is a good metric for network performance in wormhole networks. The first algorithm recursively divides the whole network into 2×2 networks. After specially designated nodes called master nodes have collected messages, whose destinations are the rest of the basic cells, only master nodes perform complete exchange with reduced network size. Upon finishing this complete exchange among master nodes, these nodes distribute messages to the rest of the master nodes, which results in the desired complete exchange. The second algorithm, which is more practical than the first one, divides the network only once. After we present these new algorithms, we analyze time complexities and compare several algorithms. We show that our practical algorithm is efficient by a factor of 2 in the required start-up time which means that our algorithm is suitable for wormhole-routed networks

Published in:

Parallel Architectures, Algorithms, and Networks, 1999. (I-SPAN '99) Proceedings. Fourth InternationalSymposium on

Date of Conference:

1999