By Topic

Coded path routing: a new approach to broadcasting in 3-D meshes

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Al-Dubai, A.Y. ; Dept. of Comput. Sci., Glasgow Univ., UK ; Ould-Khaoua, M.

Broadcast is an important collective communication operation required by many real-world parallel applications. This paper proposes the coded path routing (or CPR for short) as a new approach for designing efficient broadcast algorithms for wormhole-switched multicomputer networks. A unique feature of the CPR is that a message can be delivered to an arbitrary number of destination nodes with single start-up latency. The CPR is then used to devise a new broadcast algorithm for the all-port 3-dimensional mesh. The algorithm requires a fixed number of message-passing steps to implement a broadcast operation irrespective of the network size. Results from an extensive comparative analysis reveal that the proposed algorithm exhibits superior performance characteristics over those of the well-known recursive doubling and extending dominating node algorithms

Published in:

Performance, Computing, and Communications, 2001. IEEE International Conference on.

Date of Conference:

Apr 2001