This Article 
 Bibliographic References 
 Add to: 
Analytical Modeling of Wormhole-Routed k-Ary n-Cubes in the Presence of Hot-Spot Traffic
July 2001 (vol. 50 no. 7)
pp. 623-634

Abstract—Several analytical models of fully adaptive routing have recently been proposed for wormhole-routed k-ary n-cubes under the uniform traffic pattern. However, there has been hardly any model reported yet that deals with other important nonuniform traffic patterns, such as hot-spots. As a result, most studies have resorted to simulation when evaluating the performance merits of adaptive routing. In an effort to fill this gap, this paper describes the first analytical model of fully adaptive routing in k-ary n-cubes in the presence of hot-spot traffic. Results from simulation show close agreement with those predicted by the model.

[1] S. Abraham and K. Padmanabhan, "Performance of the Direct Binary n-Cube Network for Multiprocessors," IEEE Trans. Computers, vol. 38, no. 7, pp. 1000-1011, July 1989.
[2] A. Agarwal, "Limits on Interconnection Network Performance," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 4, pp. 398-412, Oct. 1991.
[3] Y. Boura, C.R. Das, and T.M. Jacob, “A Performance Model for Adaptive Routing in Hypercubes,” Proc. Int'l Workshop Parallel Processing, pp. 11-16, Dec. 1994.
[4] A.A. Chien, “A Cost and Performance Model for$k$-ary$n$-cubes Wormhole Routers,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 2, pp. 150-162, Feb. 1998.
[5] B. Ciciani, M. Colajanni, and C. Paolucci, “An Accurate Model for the Performance Analysis of Deterministic Wormhole Routing,” Proc. 11th Int'l Parallel Processing Symp., pp. 353-359, 1997.
[6] S.L. Scott and G.M. Thorson, “The Cray T3E Network: Adpative Routing in a High-Performance 3D Torus,,” Proc. HOT Interconnects, Aug. 1996
[7] W.J. Dally and C.L. Seitz, “Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,” IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp. 547-553.
[8] W.J. Dally, "Performance Analysis of k-ary n-Cube Interconnection Networks," IEEE Trans. Computers, vol. 39, no. 6, pp. 775-785, June 1992.
[9] W.J. Dally, "Virtual-Channel Flow Control," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 2, pp. 194-205, Mar. 1992.
[10] W.J. Dally, L.R. Dennison, D. Harris, K. Kan, and T. Xanthopoulus, “The Reliable Router: A Reliable and High-Performance Communication Substrate for Parallel Computers,” Proc. Workshop Parallel Computer Routing and Comm., pp. 241–255, May 1994.
[11] J.T. Draper and J. Ghosh, "A Comprehensive Analytical Model for Wormhole Routing in Multicomputer Systems," J. Parallel and Distributed Computing, vol. 23, pp. 202-214, Nov. 1994.
[12] J. Duato, "A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 12, pp. 1,320-1,331, Dec. 1993.
[13] J. Duato, S. Yalamanchili, and L.M. Ni, Interconnection Networks: An Engineering Approach. Los Alamitos, Calif.: IEEE CS Press, 1997.
[14] R. Greenberg and L. Guan, “Modelling and Comparison of Wormhole Routed Mesh and Torus Networks,” Proc. Ninth IASTED Int'l Conf. Parallel and Distributed Computing and Systems, 1997.
[15] D. Bäumer et al., "Framework Development for Large Systems," Comm. ACM, vol. 40, no. 10, Oct. 1997, pp. 52-59.
[16] R.E. Kessler and J.L. Schwarzmeier, "CRAY T3D: A New Dimension for Cray Research," Proc. COMPCON, pp. 176-182, Feb. 1993.
[17] J. Kim and C.R. Das, “Hypercube Communication Delay with Wormhole Routing,” IEEE Trans. Computers, vol. 43, no. 7, pp. 806-814, July 1994.
[18] L. Kleinrock, Queueing Systems, Vol. 1. New York: John Wiley, 1975.
[19] X. Lin, P.K. Mckinley, and L.M. Lin, “The Message Flow Model for Routing in Wormhole-Routed Networks,” Proc. Int'l Conf. Parallel Processing, pp. 294-297, 1993.
[20] D.H. Linder and J.C. Harden, "An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes," IEEE Trans. Computers, vol. 40, no. 1, pp. 2-12, Jan. 1991.
[21] S. Loucif, M. Ould-Khaoua, and L.M. Mackenzie, “Analysis of Fully Adaptive Routing in Wormhole-Routed Tori,” Parallel Computing, vol. 25, pp. 1477-1487, 1999.
[22] N-Cube Systems, N-cube Handbook. N-Cube, 1986.
[23] M. Noakes and W.J. Dally, “System Design of the J-Machine,” Proc. Advanced Research in VLSI, pp. 179-192, 1990.
[24] S. Nugent, "The iPSC/2 Direct-Connect Communications Technology," Proc. Third Conf. Hypercube Concurrent Computers and Applications, pp. 51-60, Jan. 1998.
[25] M. Ould-Khaoua, “A Performance Model for Duato's Adaptive Routing Algorithm ink-Aryn-Cubes,” IEEE Trans. Computers, vol. 48, no. 12, pp. 1297-1304, Dec. 1999.
[26] M. Ould-Khaoua and H. Sarbazi-Azad, “An Analytical Model of Adaptive Wormhole Routing in Hypercubes in the Presence of Hotspot Traffic,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 3, pp. 283-292, Mar. 2001.
[27] C. Peterson et al., “iWarp: A 100-MOPS VLIW Microprocessor for Multicomputers,” IEEE Micro, vol. 11, no. 2, pp. 26-37, 1991.
[28] G.J. Pfister and V.A. Norton, “Hot-Spot Contention and Combining in Multistage Interconnection Networks,” IEEE Trans. Computers, vol. 34, no. 10, pp. 943-948, Oct. 1985.
[29] J. Riorda, An Introduction to Combinatorial Analysis. John Wiley&Sons, 1958.
[30] C. L. Seitz,“The cosmic cube,”CACM, vol. 28, pp. 22–33, Jan. 1985.
[31] C.L. Seitz, “The Hypercube Communication Chip,” Display File 5182:DF:85, Dept. of Computer Science, California Inst. of Technology, Mar. 1985.
[32] C. Su and K.G. Shin, “Adaptive Deadlock-Free Routing in Multicomputers Using One Extra Channel,” Proc. Int'l Conf. Parallel Processing, pp. 175-182, 1993.
[33] W.A. Whiteworth, Choice and Chance. Cambridge Univ. Press, 1901.

Index Terms:
Multicomputers, interconnection networks, k-ary n-cubes, wormhole routing, fully adaptive routing, nonuniform traffic, hot-spot, message latency, performance modeling.
Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Lewis M. Mackenzie, "Analytical Modeling of Wormhole-Routed k-Ary n-Cubes in the Presence of Hot-Spot Traffic," IEEE Transactions on Computers, vol. 50, no. 7, pp. 623-634, July 2001, doi:10.1109/12.936230
Usage of this product signifies your acceptance of the Terms of Use.