Abstract
Degree-four chordal rings demonstrate many attractive properties, such as node symmetry, constant degree, O(√N) diameter and the ability to interconnect an arbitrary number of nodes. The authors study the abilities of degree-four chordal rings to execute parallel programs using graph-embedding techniques. Since many algorithms have been designed for meshes and TORUS networks, the issue of embedding meshes and TORUS networks onto degree-four chordal rings is addressed. Mapping functions, simple and snake-like, of embedding meshes and TORUS networks onto the degree-four chordal rings is discussed in detail. It is shown that the ILLIAC network is a special class of the degree-four chordal ring. Topological properties are investigated, such as diameter and average distance of ILLIAC networks and optimal degree-four chordal rings, another special class of degree-four chordal rings. Comparisons of ILLIAC networks and optimal chordal rings in these embedding issues are given.
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 callMore From: IEE Proceedings - Computers and Digital Techniques
Disclaimer: 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.
