Abstract
The torus is a topology that is the basis for the communication network of several multicomputers in use today. This paper briefly explores several topological characteristics of a generalized torus network using concepts from Coding theory and Graph theory. From Coding theory, the Lee distance metric and Gray codes are extended to mixed radix numbers. Lee distance is used to state the number and length of disjoint paths between two nodes in a torus. In addition, a function mapping a sequence of mixed radix numbers to a mixed radix Gray code sequence is described; and, provided at least one radix is even, this sequence is used to embed in the torus a cycle of any even length, including a Hamiltonian cycle. The torus is defined both as a cross product of cycles and using Lee distance. The graph-theoretic definition of a torus leads to a simple single node broadcasting algorithm, which is described in the last section.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
