This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Lee Distance and Topological Properties of k-ary n-cubes
August 1995 (vol. 44 no. 8)
pp. 1021-1030

Abstract—In this paper, we consider various topological properties of a k-ary n-cube $(Q^k_n)$ using Lee distance. We feel that Lee distance is a natural metric for defining and studying a $Q^k_n$.

After defining a $Q^k_n$ graph using Lee distance, we show how to find all disjoint paths between any two nodes. Given a sequence of radix k numbers, a function mapping the sequence to a Gray code sequence is presented, and this function is used to generate a Hamiltonian cycle.

Embedding the graph of a mesh and the graph of a binary hypercube into the graph of a $Q^k_n$ is considered. Using a k-ary Gray code, we show the embedding of a $k^{n_1}\times k^{n_2}\times \,\,\ldots \,\,\times k^{n_m}-$ dimensional mesh into a $Q^k_n$ where $n\,\,=\,\,\sum\nolimits_{i=1}^m {n_i}$. Then using a single digit, 4-ary reflective Gray code, we demonstrate embedding a Qn into a $Q^4_{\lceil {n\over 2}\rceil}$.

We look at how Lee distance may be applied to the problem of resource placement in a $Q^k_n$ by using a Lee distance error-correcting code. Although the results in this paper are only preliminary, Lee distance error-correcting codes have not been applied previously to this problem.

Finally, we consider how Lee distance can be applied to message routing and single-node broadcasting in a $Q^k_n$. In this section we present two single-node broadcasting algorithms that are optimal when single-port and multi-port I/O is used.

[1] E.R. Berlekamp,Algebraic Coding Theory.New York: McGraw-Hill, 1968.
[2] L.N. Bhuyan and D.P. Agrawal,“Generalized hypercube and hyperbusstructures for a computer network,” IEEE Trans. Computers, vol. 33, no. 4, pp. 323-333, Apr. 1984.
[3] S. Borkar, R. Cohn, 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 High-Speed Parallel Computing, Proc. 1988 Int'l Conf. Supercomputing, pp. 330-339., IEEE CS and ACM SIGARCH, Orlando, Fla., Nov. 1988.
[4] H.-L. Chen and N.-F. Tzeng,“Fault-tolerant resource placement in hypercube computers,” Proc. 1991 Int’l Conf. Parallel Processing, vol. I, pp. 517-524, Aug. 1991.
[5] G.-M. Chiu and C.S. Raghavendra, "Resource Allocation in Hypercube Systems," Proc. Fifth Distributed Memory Computing, vol. 1, pp. 894-902, Apr. 1990.
[6] W.J. Dally, "The Message-Driven Processor: A Multicomputer Processing Node with Efficient Mechanisms," IEEE Micro, pp. 23-39, Apr. 1992.
[7] W.J. Dally,A. Chien,S. Fiske,W. Horwat,J. Keen,M. Larivee,R. Lethin,P. Nuth,S. Wills,P. Carrick,, and G. Fyler,“The J-machine: A fine-grainconcurrent computer,” Information Processing 89, pp. 1,147-1,153, Elsevier Science Publishers B.V., 1989.
[8] S.W. Golomb and L.R. Welch,“Algebraic coding and the Lee metric,” Error Correcting Codes, H.B. Mann, ed., Univ. of Wisconsin, Madison, pp. 175-194, Math. Research Center, US Army, May 1968.
[9] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[10] M. Livingston and Q.F. Stout,“Distributing resources in hypercube computers,” Proc. Third Conf. Hypercube Concurrent Computers and Applications, vol. I, pp. 222-231,Pasadena, Calif., Jan. 1988.
[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] W. Oed,“The Cray Research massively parallel processor system: CRAY T3D,” Nov. 1993.
[13] P. Ramanathan and S. Chalasani,“Resource placement in k-ary n-cubes,” Proc. 1992 Int’l Conf. Parallel Processing, vol. II, pp. 133-140, Aug. 1992.
[14] A.L.N. Reddy,P. Banerjee,, and S.G. Abraham,“I/O embeddings in hypercubes,” Proc. 1988 Int’l Conf. Parallel Processing, pp. 331-338, Aug. 1988.
[15] R. Roth and P. Siegal,“A family of BCH codes for the Lee metric,” Proc. 1993 IEEE Symp. Information Theory, p. 35,San Antonio, Tex., Jan. 1993.
[16] 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 technicalreport,” Technical report Caltec-CS-TR-88-18, California Inst. of Tech nology, Nov. 1988.
[17] C.L. Seitz et al., "The Architecture and Programming of the Ametak Series 2010," Proc. Third Conf. Hypercube Concurrent Computers and Applications, pp. 33-37, Jan. 1988.

Index Terms:
K-ary n-cubes, Lee distance, error-correcting codes, Gray codes, Hamiltonian cycles, routing, broadcasting, embedding.
Citation:
Bob Broeg, Bella Bose, Younggeun Kwon, Yaagoub Ashir, "Lee Distance and Topological Properties of k-ary n-cubes," IEEE Transactions on Computers, vol. 44, no. 8, pp. 1021-1030, Aug. 1995, doi:10.1109/12.403718
Usage of this product signifies your acceptance of the Terms of Use.