
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Iain A. Stewart, Yonghong Xiang, "Embedding Long Paths in kAry nCubes with Faulty Nodes and Links," IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 8, pp. 10711085, August, 2008.  
BibTex  x  
@article{ 10.1109/TPDS.2007.70787, author = {Iain A. Stewart and Yonghong Xiang}, title = {Embedding Long Paths in kAry nCubes with Faulty Nodes and Links}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {19}, number = {8}, issn = {10459219}, year = {2008}, pages = {10711085}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2007.70787}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Embedding Long Paths in kAry nCubes with Faulty Nodes and Links IS  8 SN  10459219 SP1071 EP1085 EPD  10711085 A1  Iain A. Stewart, A1  Yonghong Xiang, PY  2008 KW  Interconnection architectures KW  Fault tolerance VL  19 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] B. Aiello and T. Leighton, “Coding Theory, Hypercube Embeddings and Fault Tolerance,” Proc. Third Ann. ACM Symp. Parallel Algorithms and Architectures (SPAA '91), pp. 125136, 1991.
[2] S.G. Akl, Parallel Computation: Models and Methods. Prentice Hall, 1997.
[3] E. Anderson, J. Brooks, C. Grassl, and S. Scott, “Performance of the Cray T3E Multiprocessor,” Proc. ACM/IEEE Conf. Supercomputing, pp. 117, 1997.
[4] W.C. Athas and C.L. Seitz, “Multicomputers: MessagePassing Concurrent Computers,” Computer, vol. 21, pp. 924, 1988.
[5] Y. Bruck, R. Cypher, and C.T. Ho, “Efficient FaultTolerant Mesh and Hypercube Architectures,” Proc. 22nd Int'l Symp. FaultTolerant Computing (FTCS '92), pp. 162169, 1992.
[6] J.P. Brunet and S.L. Johnsson, “AlltoAll Broadcast and Applications on the Connection Machine,” Int'l J. Supercomputer Applications, vol. 6, pp. 241256, 1992.
[7] S. Borkar, R. Cohen, G. Cox, S. Gleason, T. Gross, H.T. Kung, M. Lam, B. Moore, C. Peterson, J. Pieper, L. Rankin, P.S. Tseng, J. Sutton, J. Urbanski, and J. Webb, “iWarp: An Integrated Solution to HighSpeed Parallel Computing,” Proc. Int'l Conf. Supercomputing, pp. 330339, 1988.
[8] R.J. Cole, B.M. Maggs, and R.K. Sitaraman, “Reconfiguring Arrays with Faults I: WorstCase Faults,” SIAM J. Computing, vol. 26, pp.15811611, 1997.
[9] R. Duncan, “A Survey of Parallel Computer Architectures,” Computer, vol. 23, pp. 516, 1990.
[10] T.H. Duncan, “Performance of the Intel iPSC/860 and Ncube 6400 Hypercubes,” Parallel Computing, vol. 17, pp. 12851302, 1991.
[11] J.S. Fu, “Longest FaultFree Paths in Hypercubes with Vertex Faults,” Information Sciences, vol. 176, pp. 759771, 2006.
[12] J. Hastad, T. Leighton, and M. Newman, “Reconfiguring a Hypercube in the Presence of Faults,” Proc. 19th Ann. ACM Symp. Theory of Computing (STOC '97), pp. 274284, 1997.
[13] S.Y. Hsieh and N.W. Chang, “Optimal NodetoNode Path Embedding in Hypercubes with Conditional Faults,” IEEE Trans. Parallel and Distributed Systems, to be published.
[14] R.E. Kessler and J.L. Schwarzmeier, “CRAY T3D: A New Dimension for Cray Research,” Proc. 38th IEEE CS Int'l Conf. (Compcon '93), pp. 176182, 1993.
[15] H.C. Kim and J.H. Park, “Fault Hamiltonicity of TwoDimensional Torus Networks,” Proc. Fifth JapanKorea Joint Workshop Algorithms and Computation (WAAC '00), pp. 110117, 2000.
[16] F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays. Trees. Hypercubes. Morgan Kaufmann, 1992.
[17] F.T. Leighton, B.M. Maggs, and R.K. Sitaraman, “On the Fault Tolerance of Some Popular BoundedDegree Networks,” SIAM J.Computing, vol. 27, pp. 13031333, 1998.
[18] M.D. Noakes, D.A. Wallach, and W.J. Dally, “The JMachine Multicomputer: An Architectural Evaluation,” Proc. 20th Ann. Int'l Symp. Computer Architecture (ISCA '93), pp. 224235, 1993.
[19] C.L. Seitz, “The Cosmic Cube,” Comm. ACM, vol. 28, pp. 2233, 1985.
[20] C.L. Seitz, W.C. Athas, C.M. Flaig, A.J. Martin, J. Scizovic, C.S. Steele, and W.K. Su, “Submicron Systems Architecture Project Semiannual Technical Report,” Technical Report CaltecCSTR8818, California Inst. of Tech nology, 1988.
[21] I.A. Stewart, “Distributed Algorithms for Building Hamiltonian Cycles in $k\hbox{}{\rm Ary}\;n\hbox{}{\rm Cubes}$ and Hypercubes with Faulty Links,” Proc. 12th Int'l Conf. Parallel and Distributed Systems (ICPADS '06), pp.308318, 2006.
[22] M.C. Yang, J.J.M. Tan, and L.H. Hsu, “Hamiltonian Circuit and Linear Array Embeddings in Faulty $k\hbox{}{\rm Ary}\;n\hbox{}{\rm Cubes}$ ,” J. Parallel and Distributed Computing, vol. 67, no. 4, pp. 362368, 2007.