This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Performance of Crossbar-Based Binary Hypercubes
October 1995 (vol. 44 no. 10)
pp. 1208-1215

Abstract—Wormhole routing is an attractive routing technique offering low latency communication without the need to buffer an entire packet in a single node. A new queueing-theoretic model for obtaining throughput and latency of binary hypercubes supporting wormhole routing is developed here. The model is very accurate in predicting the performance of an actual multicomputer over a range of network sizes, packet lengths, and input port priority mappings. Utilizing the model, the performance of networks with identical topologies but different node architectures is estimated.

[1] S. Abraham,“Issues in the architecture of direct interconnection schemesfor multiprocessors,” PhD dissertation, Univ. of Illi nois, Mar. 1990.
[2] G.E. Blelloch, C.E. Leiserson, B.M. Maggs, C.G. Plaxton, S. Smith, and M. Zagha, "A Comparison of Sorting Algorithms for the Connection Machine CM-2," Proc. Third Ann. ACM Symp. Parallel Algorithms and Architectures, pp. 3-16, July 1991.
[3] E. Coffman and P. Denning,Operating System Theory.Englewood Cliffs, N.J.: Prentice Hall, 1973.
[4] W. Dally, A VLSI Architecture for Concurrent Data Structures, Kluwer Academic Publishers, Boston, 1987.
[5] 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.
[6] W.J. Dally, "Performance Analysis of k-ary n-Cube Interconnection Networks," IEEE Trans. Computers, vol. 39, no. 6, pp. 775-785, June 1992.
[7] F.T. Hady,“A performance study of wormhole routed networks throughanalytical modeling and experimentation,” PhD dissertation, Univ. of Maryland, Aug. 1993.
[8] P. Kermani, and L. Kleinrock,“Virtual cut-through: A new computer communications switching technique,” Computer Networks, vol. 3, pp. 267-286.
[9] L. Kleinrock,Queueing Systems, Volume I: Theory.New York: John Wiley&Sons, 1975.
[10] L. Kleinrock,Queueing Systems, Volume II: Computer Applications.New York: John Wiley&Sons, 1976.
[11] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.
[12] D. Smitley,F. Hady,, and D. Burns,“Hnet: A high-performance network evaluation testbed,” Int’l Conf. Parallel Processing, Aug. 1992.
[13] H. Yoon,K.Y. Lee,, and M.T. Liu,“Performance analysis of multibuffered packet-switching networks in multiprocessor systems,” IEEE Trans. Computers, vol. 39, no. 3, pp. 319-327, Mar. 1990.

Index Terms:
Binary hypercube, crossbar, distributed queue, latency, throughput, wormhole routing.
Citation:
Bernard L. Menezes, Frank T. Hady, "The Performance of Crossbar-Based Binary Hypercubes," IEEE Transactions on Computers, vol. 44, no. 10, pp. 1208-1215, Oct. 1995, doi:10.1109/12.467695
Usage of this product signifies your acceptance of the Terms of Use.