This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A High-Performance Deadlock-Free Multicast Routing Algorithm for K-Ary N-Cubes
February 2010 (vol. 59 no. 2)
pp. 174-187
ASCII Text
x 
 
Chiara Francalanci, Paolo Giacomazzi, "A High-Performance Deadlock-Free Multicast Routing Algorithm for K-Ary N-Cubes," IEEE Transactions on Computers, vol. 59, no. 2, pp. 174-187, February, 2010.
 
 
BibTex
x
 
@article{ 10.1109/TC.2009.90,
author = {Chiara Francalanci and Paolo Giacomazzi},
title = {A High-Performance Deadlock-Free Multicast Routing Algorithm for K-Ary N-Cubes},
journal ={IEEE Transactions on Computers},
volume = {59},
number = {2},
issn = {0018-9340},
year = {2010},
pages = {174-187},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2009.90},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - A High-Performance Deadlock-Free Multicast Routing Algorithm for K-Ary N-Cubes
IS - 2
SN - 0018-9340
SP174
EP187
EPD - 174-187
A1 - Chiara Francalanci,
A1 - Paolo Giacomazzi,
PY - 2010
KW - Multicast communication
KW - multiprocessor interconnection
KW - distributed control
KW - computer network performance.
VL - 59
JA - IEEE Transactions on Computers
ER -
 
Chiara Francalanci, Politecnico di Milano, Milano
Paolo Giacomazzi, Politecnico di Milano, Milano
Current multicast routing algorithms for multiprocessor systems are based on the reservation of transmission resources and buffer space for messages before transmission. This strategy causes cyclic dependencies among messages and, in turn, deadlock situations. This paper proposes and evaluates the performance of a new multicast routing algorithm, called Deadlock-Free Multicast Routing (DFMR), which removes the root cause of deadlocks. DFMR prevents deadlocks by allowing nodes to send flits as soon as internode links are available for transmission. This is obtained by allowing any possible interleaving of flits from all messages on internode links. The resulting routing algorithm eliminates the need to implement deadlock avoidance, detection, and recovery mechanisms, but needs larger output buffers. In DFMR, message flits carry additional information overhead which is used to avoid deadlock. Simulation results show that this information overhead has a negligible impact on overall performance which is considerably greater than that of previous algorithms.

[1] R. Boppana, S. Chalasani, and C. Raghavendra, “Resource Deadlocks and Performance of Wormhole Multicast Routing Algorithms,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 6, pp. 535-549, June 1998.
[2] K.V. Anjan and T. Pinkston, “An Efficient, Fully Adaptive Deadlock Recovery Scheme: DISHA,” Proc. Int'l Symp. Computer Architecture, pp. 201-210, 1995.
[3] J. Kim, Z. Liu, and A. Chien, “Compressionless Routing,” Proc. Int'l Symp. Computer Architecture (ISCA), Apr. 1994.
[4] J. Martinez, P. Lopez, J. Duato, and T. Pinkston, “Software-Based Deadlock Recovery Technique for True Fully Adaptive Routing in Wormhole Networks,” Proc. Int'l Conf. Parallel Processing, Aug. 1997.
[5] F. Petrini, J. Duato, P. Lopez, and J. Martinez, “LIFE: A Limited Injection, Fully Adaptive, Recovery-Based Routing Algorithm,” Proc. Fourth Int'l Conf. High Performance Computing, Dec. 1997.
[6] R. Boppana, S. Chalasani, and C. Raghavendra, “On Multicast Wormhole Routing in Multicomputer Networks,” Proc. Symp. Parallel Distributed Processing, Oct. 1994.
[7] NCUBE Co., NCUBE 6400 Processor Manual. NCUBE Co., 1990.
[8] G. Byrd, N. Saraiya, and B. Delagi, “Multicast Communication in Multiprocessor Systems,” Proc. Int'l Conf. Parallel Processing, vol. 1, pp. 196-200, Aug. 1989.
[9] G. Byrd, R. Nakano, and B. Delagi, “A Dynamic Cut-Through Communication Protocol with Multicast,” Technical Report STAN-CS-87-1148, Stanford Univ., Aug. 1987.
[10] A. Al-Dubai, M. Ould-Khaoua, and L. Mackenzie, “On Balancing Network Traffic in Path-Based Multicast Communication,” Future Generation Computer Systems, vol. 22, no. 7, pp. 805-811, Aug. 2006.
[11] D.F. Robinson, P.K. McKinley, and C. Cheng, “Path Based Multicast Communication in Wormhole Routed Unidirectional Torus Networks,” J. Parallel Distributed Computing, vol. 45, pp. 104-121, 1997.
[12] X. Lin and L.M. Ni, “Deadlock-Free Multicast Wormhole Routing Multicomputer Networks,” Proc. Int'l Symp. Computer Architecture, pp. 116-124, 1991.
[13] D.R. Kumar, W.A. Najjar, and P.K. Srimani, “A New Adaptive Hardware Tree-Based Multicast Routing in $k$ -Ary $n$ -Cubes,” IEEE Trans. Computers, vol. 50, no. 7, pp. 647-659, July 2001.
[14] C. Francalanci and P. Giacomazzi, “High-Performance Self-Routing Algorithm for Multiprocessor Systems with Shuffle Interconnections,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 1, pp. 38-50, Jan. 2006.
[15] R. Boppana, S. Chelasani, and C. Raghavendra, “Resource Deadlocks and Performance of Wormhole Multicast Routing Algorithms,” IEEE Trans. Parallel and Distributed Systems, 1998.
[16] E. Fleury and P. Fraigniaud, “Multicasting in Meshes,” Proc. Int'l Conf. Parallel Processing, 1994.
[17] J. Duato, “A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks,” Proc. Symp. Parallel Distributed Processing, 1993.
[18] N.F. Maxemchuk, “Routing in the Manhattan Street Network,” IEEE Trans. Comm., vol. 35, no. 3, pp. 503-512, May 1987.

Index Terms:
Multicast communication, multiprocessor interconnection, distributed control, computer network performance.
Citation:
Chiara Francalanci, Paolo Giacomazzi, "A High-Performance Deadlock-Free Multicast Routing Algorithm for K-Ary N-Cubes," IEEE Transactions on Computers, vol. 59, no. 2, pp. 174-187, Feb. 2010, doi:10.1109/TC.2009.90
Usage of this product signifies your acceptance of the Terms of Use.