
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Mohamed OuldKhaoua, "A Performance Model for Duato's Fully Adaptive Routing Algorithm in k$k$Ary n$n$Cubes," IEEE Transactions on Computers, vol. 48, no. 12, pp. 12971304, December, 1999.  
BibTex  x  
@article{ 10.1109/12.817384, author = {Mohamed OuldKhaoua}, title = {A Performance Model for Duato's Fully Adaptive Routing Algorithm in k$k$Ary n$n$Cubes}, journal ={IEEE Transactions on Computers}, volume = {48}, number = {12}, issn = {00189340}, year = {1999}, pages = {12971304}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.817384}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Performance Model for Duato's Fully Adaptive Routing Algorithm in k$k$Ary n$n$Cubes IS  12 SN  00189340 SP1297 EP1304 EPD  12971304 A1  Mohamed OuldKhaoua, PY  1999 KW  Multicomputers KW  interconnection networks KW  adaptive routing KW  deterministic routing KW  virtual channels KW  message latency KW  performance modeling. VL  48 JA  IEEE Transactions on Computers ER   
Abstract—Analytical models of deterministic routing in wormholerouted
[1] A. Agarwal, "Limits on Interconnection Network Performance," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 4, pp. 398412, Oct. 1991.
[2] Y. Boura, C.R. Das, and T.M. Jacob, “A Performance Model for Adaptive Routing in Hypercubes,” Proc. Int'l Workshop Parallel Processing, pp. 1116, Dec. 1994.
[3] 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. 150162, Feb. 1998.
[4] 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. 353359, 1997.
[5] Cray Research Inc., “The Cray T3E Scalable Parallel Processing System,” on Cray's web page athttp://www.cray.com/PUBLIC/productinfoT3E .
[6] W.J. Dally and C.L. Seitz, “DeadlockFree Message Routing in Multiprocessor Interconnection Networks,” IEEE Trans. Computers, Vol. C36, No. 5, May 1987, pp. 547553.
[7] W.J. Dally, "Performance Analysis of kary nCube Interconnection Networks," IEEE Trans. Computers, vol. 39, no. 6, pp. 775785, June 1992.
[8] W.J. Dally, "VirtualChannel Flow Control," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 2, pp. 194205, Mar. 1992.
[9] W.J. Dally, L.R. Dennison, D. Harris, K. Kan, and T. Xanthopoulus, “The Reliable Router: A Reliable and HighPerformance Communication Substrate for Parallel Computers,” Proc. Workshop Parallel Computer Routing and Comm., pp. 241–255, May 1994.
[10] J. Duato, "A New Theory of DeadlockFree Adaptive Routing in Wormhole Networks," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 12, pp. 1,3201,331, Dec. 1993.
[11] J. Duato and P. López, "Performance Evaluation of Adaptive Routing Algorithms for kary ncubes," Proc. Workshop Parallel Computer Routing and Communication, May. 1994.
[12] J.T. Draper and J. Ghosh, "A Comprehensive Analytical Model for Wormhole Routing in Multicomputer Systems," J. Parallel and Distributed Computing, vol. 23, pp. 202214, Nov. 1994.
[13] 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.
[14] D. Bäumer et al., "Framework Development for Large Systems," Comm. ACM, vol. 40, no. 10, Oct. 1997, pp. 5259.
[15] R.E. Kessler and J.L. Schwarzmeier, "CRAY T3D: A New Dimension for Cray Research," Proc. COMPCON, pp. 176182, Feb. 1993.
[16] L. Kleinrock, Queueing Systems, vol. 1.New York: John Wiley, 1975.
[17] J. Kim and C.R. Das, “Hypercube Communication Delay with Wormhole Routing,” IEEE Trans. Computers, vol. 43, no. 7, pp. 806814, July 1994.
[18] D.H. Linder and J.C. Harden, "An Adaptive and Fault Tolerant Wormhole Routing Strategy for kAry nCubes," IEEE Trans. Computers, vol. 40, no. 1, pp. 212, Jan. 1991.
[19] X. Lin, P.K. Mckinley, and L.M. Lin, “The Message Flow Model for Routing in WormholeRouted Networks,” Proc. Int'l Conf. Parallel Processing, pp. 294297, 1993.
[20] M. Noakes and W.J. Dally, “System Design of the JMachine,” Proc. Advanced Research in VLSI, pp. 179192, 1990.
[21] S. Nugent, "The iPSC/2 DirectConnect Communications Technology," Proc. Third Conf. Hypercube Concurrent Computers and Applications, pp. 5160, Jan. 1998.
[22] J. Riorda, An Introduction to Combinatorial Analysis, chapter 5, pp. 104105. John Wiley&Sons, 1958.
[23] C. L. Seitz,“The cosmic cube,”CACM, vol. 28, pp. 22–33, Jan. 1985.
[24] C.L. Seitz, “The Hypercube Communication Chip,” Display File 5182:DF:85, Dept. of Computer Science, California Inst. of Tech nology, Mar. 1985.
[25] C. Su and K.G. Shin, “Adaptive DeadlockFree Routing in Multicomputers Using One Extra Channel,” Proc. Int'l Conf. Parallel Processing, pp. 175182, 1993.
[26] W.A. Whiteworth, Choice and Chance, p. 91. Cambridge Univ. Press, 1901.