Abstract
In this paper, a general class of multiple-clique structures is presented. The interconnection is based on a mixed radix number system that results in a variety of multiple-clique structures for a given number of processors N = x′ · 2 y , where x and y are positive integers. A number of interested properties of the network are presented. By a constructive method, the node connectivity of the multiple-clique network is found. We then show that the graph is super-λ and is an optimal reliable structure for interconnection networks. The structure also possesses many other useful properties, such as small average message distance, Hamiltonian, point transitive, etc.
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.
