Deadlock-Free Routing (![]() ![]() ![]() ![]() - L. Sheng and J. Wu, "A Note on 'A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing," IEEE Transactions on Computers, 49, 9, Sept. 2000, 1005. - - J. Wu and L. Sheng, "Deadlock-Free Multicasting in Irregular Networks Using Prefix Routing," Journal of Supercomputing, Vo. 31, No. 1, January 2005, 63-78. - J. Wu and D. Wang, "Fault-tolerant and Deadlock-free
Routing in 2-D Meshes Using Rectilinear-Monotone Polygonal Fault
Blocks," International Journal of Parallel, Emergent and
Distributed Systems, Vol. 20, No. 2, June 2005, 99-111. ![]() ![]() |