The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2009 vol.58)
pp: 620-633
Dong Xiang , Tsinghua University, Beijing
Yueli Zhang , Tsinghua University, Beijing
Yi Pan , Goregia State University, Atalanta
ABSTRACT
The number of virtual channels required for deadlock-free routing is important for cost-effective and high-performance system design. The planar adaptive routing scheme is an effective deadlock avoidance technique using only three virtual channels for each physical channel in 3D or higher dimensional mesh networks with a very simple deadlock avoidance scheme. However, there exist one idle virtual channel for all physical channels along the first dimension and two idle virtual channels for channels along the last dimension in a mesh network based on the planar adaptive routing algorithm. A new deadlock avoidance technique is proposed for 3D meshes using only two virtual channels by making full use of the idle channels. The deadlock-free adaptive routing scheme is then modified to a deadlock-free adaptive fault-tolerant routing scheme based on a planar network (PN) fault model. The proposed deadlock-free adaptive routing scheme is also extended to n-dimensional meshes still using two virtual channels. Sufficient simulation results are presented to demonstrate the effectiveness of the proposed algorithm.
INDEX TERMS
Deadlock-free fault-tolerant routing, mesh, planar adaptive routing, planar network fault model.
CITATION
Dong Xiang, Yueli Zhang, Yi Pan, "Practical Deadlock-Free Fault-Tolerant Routing in Meshes Based on the Planar Network Fault Model", IEEE Transactions on Computers, vol.58, no. 5, pp. 620-633, May 2009, doi:10.1109/TC.2008.211
REFERENCES
[1] N.R. Adiga, et al., “Blue Gene/L Torus Interconnection Network,” IBM J. Research and Development, vol. 49, pp. 265-276, Mar.-May 2005.
[2] R.V. Boppana and S. Chalasani, “Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks,” IEEE Trans. Computers, vol. 44, no. 7, pp. 848-864, July 1995.
[3] R.V. Boppana and S. Chalasani, “Fault-Tolerant Communication with Partitioned Dimension-Order Router,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 10, pp. 1026-1039, Oct. 1999.
[4] Y.M. Boura and C.R. Das, “Fault-Tolerant Routing in Mesh Networks,” Proc. IEEE Int'l Conf. Parallel Processing (ICPP '95), vol. 1, pp. 106-109, 1995.
[5] C.L. Chen and G.M. Chiu, “A Fault-Tolerant Routing Scheme for Meshes with Non-Convex Faults,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 5, pp. 467-475, May 2001.
[6] J.E. Chen, G. Wang, C. Lin, T. Wang, and G. Wang, “Probabilistic Analysis on Mesh Network Fault-Tolerance,” J. Parallel and Distributed Computing, vol. 67, no. 1, pp. 100-110, 2007.
[7] A.A. Chien and J.H. Kim, “Planar Adaptive Routing: Low-Cost Adaptive Networks for Multiprocessors,” J. ACM, vol. 42, no. 1, pp. 91-123, 1995.
[8] W.J. Dally and H. Aoki, “Deadlock-Free Adaptive Routing Multicomputer Networks Using Virtual Channels,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 4, pp. 466-475, Apr. 1993.
[9] W.J. Dally and G.L. Seitz, “Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,” IEEE Trans. Computers, vol. 36, no. 5, pp. 547-553, May 1987.
[10] J. Duato, S. Yalamanchili, and L. Ni, Interconnection Networks: An Engineering Approach. IEEE Press, 1997.
[11] J. Duato, “A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 12, pp. 1320-1331, Dec. 1993.
[12] P.T. Gaughan, B.V. Dao, S. Yalamanchili, and D.E. Schimmel, “Distributed, Deadlock-Free Routing in Faulty, Pipelined, Direct Interconnection Networks,” IEEE Trans. Computers, vol. 45, no. 6, pp. 651-665, June 1996.
[13] C.J. Glass and L.M. Ni, “The Turn Model for Adaptive Routing,” J.ACM, vol. 40, no. 5, pp. 874-902, 1994.
[14] M.E. Gomez, J. Flich, P. Lopez, A. Robles, J. Duato, N.A. Nordbotten, O. Lysne, and T. Skeie, “An Effective Fault-Tolerant Routing Methodology for Direct Networks,” Proc. 33rd Int'l Conf. Parallel Processing (ICPP '04), pp. 222-231, 2004.
[15] M.E. Gomez, N.A. Nordbotten, J. Flich, P. Lopez, A. Robles, J. Duato, T. Skeie, and O. Lysne, “A Routing Methodology for Achieving Fault Tolerance in Direct Networks,” IEEE Trans. Computers, vol. 55, no. 4, pp. 400-415, Apr. 2006.
[16] C.T. Ho and L. Stockmeyer, “A New Approach to Fault-Tolerant Wormhole Routing for Mesh-Connected Parallel Computers,” IEEE Trans. Computers, vol. 53, no. 4, pp. 427-438, Apr. 2004.
[17] Z. Jiang, J. Wu, and D. Wang, “A New Fault Information Model for Fault-Tolerant Adaptive and Minimal Routing in 3-D Meshes,” Proc. 34th Int'l Conf. Parallel Processing (ICPP '05), pp. 500-507, 2005.
[18] Z. Jiang, J. Wu, and D. Wang, “A New Fault Information Model for Fault-Tolerant Adaptive and Minimal Routing in 3-D Meshes,” IEEE Trans. Reliability, vol. 57, no. 1, pp. 149-162, Mar. 2008.
[19] R. Libeskind-Hadas, “A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing,” IEEE Trans. Computers, vol. 47, no. 10, pp. 1158-1160, Oct. 1998.
[20] D.H. Linder and J.C. Harden, “An Adaptive and Fault-Tolerant Wormhole Routing Strategy for $k$ -Ary $n$ -Cube,” IEEE Trans. Computers, vol. 40, no. 1, pp. 2-12, Jan. 1991.
[21] S.S. Mukerhjee, R. Bannon, S. Lang, and A. Spink, “The Alpha 21364 Network Architecture,” IEEE Micro, vol. 22, no. 1, pp.26-35, Jan./Feb. 2002.
[22] V. Puente, J.A. Gregorio, F. Vallejo, and R. Beivide, “Immunet: A Cheap and Robust Fault-Tolerant Packet Routing Mechanism,” Proc. 31st ACM/IEEE Int'l Symp. Computer Architecture (ISCA '04), pp. 198-209, 2004.
[23] V. Puente and J.A. Gregorio, “Immucube: Scalable Fault-Tolerant Routing for $k$ -Ary $n$ -Cube Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 8, pp. 776-788, June 2007.
[24] P.H. Sui and S.D. Wang, “An Improved Algorithm for Fault-Tolerant Wormhole Routing in Meshes,” IEEE Trans. Computers, vol. 46, no. 9, pp. 1040-1042, Sept. 1997.
[25] D. Wang, “A Rectilinear-Monotone Polygonal Fault Block Model for Fault-Tolerant Minimal Routing in Mesh,” IEEE Trans. Computers, vol. 52, no. 3, pp. 310-320, Mar. 2003.
[26] G.J. Wang, T. Li, and J. Chen, “A Probabilistic Approach to Fault-Tolerant Routing Algorithm on Mesh Networks,” Proc. 10th IEEE Int'l Conf. Parallel and Distributed Systems (ICPADS '04), pp. 577-586, July 2004.
[27] J. Wu, “A Fault-Tolerant Adaptive and Minimal Routing Approach in $n$ -Dimensional Meshes,” Proc. IEEE Int'l Conf. Parallel Processing (ICPP '00), pp. 431-438, Aug. 2000.
[28] J. Wu, “A Fault-Tolerant and Deadlock-Free Routing Protocol in 2D Meshes Based on Odd-Even Turn Model,” IEEE Trans. Computers, vol. 52, no. 9, pp. 1154-1169, Sept. 2003.
[29] J. Wu, “A Simple Fault-Tolerant Adaptive and Minimal Routing Approach in 3-D Meshes,” J. Computer Science and Technology, vol. 18, no. 1, pp. 1-13, 2003.
[30] D. Xiang, “Fault-Tolerant Routing in Hypercube Multicomputers Using Local Safety Information,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 9, pp. 942-951, Sept. 2001.
[31] D. Xiang, J.G. Sun, J. Wu, and K. Thulasiraman, “Fault-Tolerant Routing in Meshes/Tori Using Planarly Constructed Fault Blocks,” Proc. 34th Int'l Conf. Parallel Processing (ICPP '05), pp.577-584, 2005.
[32] D. Xiang, Y. Zhang, Y. Pan, and J. Wu, “Deadlock-Free Adaptive Routing in Meshes Based on Cost-Effective Deadlock Avoidance Schemes,” Proc. 36th Int'l Conf. Parallel Processing (ICPP '07), Sept. 2007.
[33] J. Zhou and F.C.M. Lau, “Adaptive Fault-Tolerant Routing with Two Virtual Channels in 2D Meshes,” Proc. Seventh Int'l Symp. Parallel Architectures, Algorithms and Networks (ISPAN '04), pp.142-148, 2004.
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool