Abstract
In this paper, we propose and analyze a new interconnection network, called Petersen-torus (PT) network based on well-known Petersen graph. Petersen graph is the graph with the most desirable network cost to the number of nodes, such that it has the most number of nodes as 10 among graphs having degree 3 and diameter 2. Taking advantage of Petersen graph, PT was designed in place of Petersen graph having 10 nodes per node of torus. PT network has a smaller diameter and a smaller network cost than honeycomb torus with same nodes. We propose routing algorithm and we derive diameter, network cost and bisection width.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.