This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Performance Model of Pipelined k-ary n-cubes
August 1995 (vol. 44 no. 8)
pp. 1059-1063

Abstract—Pipelined communication using virtual channels can realize low latency, high throughput, inter-processor communication. This paper presents an analytic performance model of pipelined communication in k-ary n-cubes. The model contains elements intended to capture and study key performance issues. In addition to the modeling of throughput and latency, the following issues are addressed using this model: 1) the tradeoff between full-duplex vs. half-duplex links, 2) the effects of intranode delay, 3) the effects of buffer size for each virtual channel. Detailed simulation experiments under a variety of conditions establish the viability of this model.

[1] A. Agarwal, "Limits on Interconnection Network Performance," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 4, pp. 398-412, Oct. 1991.
[2] A.A. Chien and J.H. Kim,“Planar-adaptive routing: Low-cost adaptive networks for multiprocessors,” Proc. 19th Int’l Symp. Computer Architecture, vol. 39, no. 6, pp. 775-785, June 1990.
[3] W.J. Dally, "Performance Analysis of k-ary n-Cube Interconnection Networks," IEEE Trans. Computers, vol. 39, no. 6, pp. 775-785, June 1992.
[4] W.J. Dally, "Virtual-Channel Flow Control," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 2, pp. 194-205, Mar. 1992.
[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] J. Duato, "Deadlock-Free Adaptive Routing Algorithms for Multicomputers: Evaluation of a New Algorithm," Proc. IEEE Symp. Parallel and Distributed Processing, pp. 840-847, 1991.
[7] P.T. Gaughan, "Design and Analysis of Fault-Tolerant Pipelined Multiprocessor Networks," technical report, PhD thesis, Georgia Inst. of Tech nology, May 1994.
[8] P.T. Gaughan and S. Yalamanchili, "A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 6, pp. 482-487, May 1995.
[9] P.T. Gaughan and S. Yalamanchili, “Adaptive Routing Protocols for Hypercube Interconnection Networks,” Computer, vol. 26, no. 5, pp. 12–23, May 1993.
[10] J. Guan,W.K. Tsai,, and B. Blough,“An analytical model for wormhole routing in multicomputer interconnection networks,” Proc. Seventh Int’l Parallel Processing Symp., pp. II:1-II:4, Apr. 1993.
[11] J. Kim and C.R. Das,“Modeling wormhold routing in hypercubes,” Proc. Int’l Conf. Distributed Systems, pp. 386-393, 1991.

Index Terms:
Adaptive routing, multipath networks, multiprocessor networks.
Citation:
Sudhakar Yalamanchili, Patrick T. Gaughan, "A Performance Model of Pipelined k-ary n-cubes," IEEE Transactions on Computers, vol. 44, no. 8, pp. 1059-1063, Aug. 1995, doi:10.1109/12.403724
Usage of this product signifies your acceptance of the Terms of Use.