This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Hypercube Communication Delay with Wormhole Routing
July 1994 (vol. 43 no. 7)
pp. 806-814

We present an analytical model for the performance evaluation of hypercube computers. This analysis is aimed at modeling a deadlock-free wormhole routing scheme prevalent on second generation hypercube systems. Probability of blocking and average message delay are the two performance measures discussed. We start with the communication traffic to find the probability of blocking. The traffic analysis can capture any message destination distribution. Next, we find the average message delay that consists of two parts. The first part is the actual message transfer delay between any source and destination nodes. The second part of the delay is due to blocking caused by the wormhole routing scheme. The analysis is also extended to virtual cut-through routing and random wormhole routing techniques. The validity of the model is demonstrated by comparing analytical results with those from simulation.

[1] J. Rattner, "Concurrent processing: A new direction in scientific computing," inAFIPS Conf. Proc., vol. 54, 1985, pp. 157-166.
[2] Y. Saad and M. H. Schultz, "Topological properties of hypercube,"IEEE Trans. Comput., vol. 37, pp. 867-872, July 1988.
[3] D. A. Reed and D. C. Grunwald, "The performance of multicomputer interconnection networks,"IEEE Comput. Mag., vol. 20, pp. 63-73, June 1987.
[4] D. P. Agrawalet al., "Evaluating the performance of multicomputer configurations,"IEEE Comput. Mag., vol. 19, pp. 23-37, May 1986.
[5] L. N. Bhuyan and D. P. Agrawal, "Generalized hypercube and hyperbus structures for a computer network,"IEEE Trans. Comput., pp. 323-333, Apr. 1984.
[6] L. D. Wittie, "Communications structures for a large multicomputer system,"IEEE Trans. Comput., vol. 30, pp. 264-273, Apr. 1981.
[7] S. Abraham and K. Padmanabhan, "Performance of the direct binaryn- cube network for multiprocessors,"IEEE Trans. Comput., vol. 38, pp. 1000-1011, July 1989.
[8] A. Shaout and D. Smyth, "Performance estimation of semirandom data transfer within direct hypercube interconnection network,"IEE Proceedings--E, vol. 138, pp. 213-221, July 1991.
[9] W. Athas and C. L. Seitz, "Multicomputers: Message-passing concurrent computers,"IEEE Computer, vol. 21, pp. 9-23, Aug. 1988.
[10] 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.
[11] NCUBE Corporation, Beaverton, Oregon, "NCUBE Manual," 1987.
[12] P. Kermani and L. Kleinrock, "Virtual cut-through: A new computer communication switching technique,"Comput. Netw., vol. 3, pp. 267-286, 1979.
[13] W. Dally, "Performance analysis ofk-aryn-cube interconnection networks,"IEEE Trans. Comput., vol. 39, pp. 775-785, June 1990.
[14] S. Borkar et al., "iWarp: An Integrated Solution to High Speed Parallel Computing,"Proc. Supercomputing 88, Vol. 1, CS Press, Los Alamitos, Calif., Order No. 882, pp. 330-339.
[15] H. Sulivan and T. R. Bashkov, "A large scale homogeneous, fully distributed parallel machine, I," inProc. 4th Symp. Comput. Arch., March 1977, pp. 105-117.
[16] D. S. Reeves, E. F. Gehringer, and A. Chandiramani, "Adaptive routing and deadlock recovery: A simulation study," inProc. 4th Hypercube Conf., 1989, pp. 331-337.

Index Terms:
performance evaluation; hypercube networks; telecommunication traffic; delays; hypercube communication delay; wormhole routing; analytical model; performance evaluation; communication traffic; traffic analysis; virtual cut-through routing.
Citation:
Jong Kim, C.R. Das, "Hypercube Communication Delay with Wormhole Routing," IEEE Transactions on Computers, vol. 43, no. 7, pp. 806-814, July 1994, doi:10.1109/12.293259
Usage of this product signifies your acceptance of the Terms of Use.