The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Once a designed network is embedded into a newly designed network, a developed algorithm in the designed network is reusable in a newly designed network. Petersen-Torus has been designed recently, and Hyper Petersen has already been designed as a well-known interconnection network. In this study, it was proven that Hyper Petersen network whose degree increases with the increased number of nodes can...
A two-dimensional (2D) Petersen-torus network is a mesh-class fixed-degree network designed using a Petersen graph, which has a maximum of 10 nodes when the degree is 3 and the diameter is 2 in a (d,k)-graph problem. Here, I propose a new three-dimensional (3D) Petersen-torus network that extends the 2D Petersen-torus network without increasing the degree. The 3D Petersen-torus has the same number...
In this paper, it was proven that Torus T(5m,2n) might be embedded into Petersen-Torus PT(m,n) at dilation 5, congestion 5, and expansion 1. It was also proven that Torus might be embedded in PT at 3 or less of average dilation. The embedding algorithm could be available in both wormhole routing system and store-and-forward routing system by embedding the generally known Torus network in PT at 5 or...
In this study, it was proven that hypercube interconnection network whose degree increases with increased dimensions might be embedded into PT network whose degree is fixed. Hypercube Q log2 n2+3 was embedded into PT(n,n) at expansion 10/8, dilation 1.5n+2, and congestion 4 n. The mapping algorithm was designed for expansion to approach 1, and congestion and dilation are in proportion to O(n) owing...
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...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.