Analysis the Performance of Interconnection Network Topology C2 Torus Based on Two Dimensional Torus

2018 ◽  
Vol 6 (6) ◽  
pp. 169 ◽  
Author(s):  
Prachi Chauhan ◽  
Manish Bhardwaj
Keyword(s):  
Network Topology ◽  
Interconnection Network ◽  
Routing Algorithm ◽  
Two Dimensional ◽  
Topological Properties ◽  
Interconnected Network ◽  
Dimensional Torus ◽  
Torus Network

Mesh and Torus are most popular interconnection topologies based on 2D-mesh.Comparison between Mesh and Torus will be considered and new interconnection topology will be proposed to provide better performance. The C2Mesh, is an enhanced mesh interconnected network. This paper enhances the torus network based on the theme of C2Mesh. Topological Properties of new network will be analyzed and implemented by simulation. The new routing Algorithm will be designed for new proposed network (C2Torus). This manuscript performs Comparison between C2Torus and C2Mesh.

scholarly journals Reliable, Effective and Fault-Tolerant Design of Leafy Cube Interconnection Network Topology

2019 ◽  
Vol 8 (12) ◽  
pp. 3163-3170
Keyword(s):  
Cost Effectiveness ◽  
Network Topology ◽  
Packing Density ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
The Other ◽  
Performance Parameters ◽  
Topological Properties ◽  
Node Packing ◽  
The Cost

This paper attempts to derive the performance properties of the Leafycube (LC) interconnection network. The Leafycube is already observed to have quite superior topological properties in comparison to the other contemporary networks. The various performance parameters of the LC network are studied and compared with the existing HC and its variants. The routing and broadcasting algorithms are proposed and the time complexities are also compared. The paper attempts to evaluate the cost effectiveness, reliability and fault tolerance aspects of LC interconnection network in order to justify the novelty in the design of the proposed structure. The leafy structure helps to retain the original hypercube while improving the node packing density in the interconnection network.

Hamiltonicity of the Torus Network Under the Conditional Fault Model

2017 ◽  
Vol 28 (03) ◽  
pp. 211-227 ◽  
Author(s):  
Jing Li ◽  
Yuxing Yang ◽  
Xiaohui Gao
Keyword(s):  
Interconnection Networks ◽  
Distributed Memory ◽  
Hamiltonian Cycle ◽  
Parallel Computers ◽  
Fault Model ◽  
Sufficient Condition ◽  
Two Dimensional ◽  
Dimensional Torus ◽  
Low Dimensional ◽  
Torus Network

Low-dimensional Tori are regularly used as interconnection networks in distributed-memory parallel computers. This paper investigates the fault-Hamiltonicity of two-dimensional Tori. A sufficient condition is derived for the graph Row-Torus(m, 2n + 1) with two faulty edges to have a Hamiltonian cycle, where m ≥ 3 and n ≥ 1. By applying the fault-Hamiltonicity of Row-Torus to a two-dimensional torus, we show that Torus(m, n), m, n ≥ 5, with at most four faulty edges is Hamiltonian if the following two conditions are satisfied: (1) the degree of every vertex is at least two, and (2) there do not exist a pair of nonadjacent vertices in a 4-cycle whose degrees are both two after faulty edges are removed.

scholarly journals Cluster-Fault Tolerant Routing in a Torus

Sensors ◽  
2020 ◽  
Vol 20 (11) ◽  
pp. 3286 ◽  
Author(s):  
Antoine Bossard ◽  
Keiichi Kaneko
Keyword(s):  
Free Path ◽  
Time Complexity ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
Routing Algorithm ◽  
Topological Properties ◽  
Huge Number ◽  
Worst Case ◽  
Faulty Node ◽  
Node Routing

The number of Internet-connected devices grows very rapidly, with even fears of running out of available IP addresses. It is clear that the number of sensors follows this trend, thus inducing large sensor networks. It is insightful to make the comparison with the huge number of processors of modern supercomputers. In such large networks, the problem of node faults necessarily arises, with faults often happening in clusters. The tolerance to faults, and especially cluster faults, is thus critical. Furthermore, thanks to its advantageous topological properties, the torus interconnection network has been adopted by the major supercomputer manufacturers of the recent years, thus proving its applicability. Acknowledging and embracing these two technological and industrial aspects, we propose in this paper a node-to-node routing algorithm in an n -dimensional k -ary torus that is tolerant to faults. Not only is this algorithm tolerant to faulty nodes, it also tolerates faulty node clusters. The described algorithm selects a fault-free path of length at most n ( 2 k + ⌊ k / 2 ⌋ − 2 ) with an O ( n 2 k 2 | F | ) worst-case time complexity with F the set of faulty nodes induced by the faulty clusters.

A New Unicast Routing Algorithm for Hyper Hexa-Cell Interconnection Networks

2017 ◽  
Vol 8 (3) ◽  
pp. 45-57
Author(s):  
Jehad Ahmed Al-Sadi
Keyword(s):  
Interconnection Networks ◽  
Interconnection Network ◽  
Routing Algorithm ◽  
Optimal Path ◽  
Destination Node ◽  
Topological Properties ◽  
Unicast Routing ◽  
Cell Topology ◽  
Store And Forward ◽  
Point To Point

The Hyper Hexa-Cell topology; HHC for short; is a new interconnection network topology that has many attractive topological properties compared to other traditional topologies. There have been a number of studies in the literature on the HHC to explore the promising topological properties of this topology. Furthermore, other studies extend this topology by combining it with OTIS technology to produce a new version called OHHC. We have found that there is a lake of presenting any point to point routing algorithm for the HHC, although there were some efforts on building routing algorithms for the OHHC. To cover this shortage, this paper introduces a new unicast routing algorithm for the HHC. The new routing algorithm for the HHC uses store-and-forward technique which allows a message to be transmitted through a path from the source node to the destination node. In addition to presenting the routing algorithm, we present an example to explore the algorithm steps and also an enhancement on the routing algorithm to apply adaptively on the routing based on parameterized criteria. Finally, we present a theoretical theorem to prove that the algorithm routes any message from any source to any destination via an optimal path.

scholarly journals Circular quiver gauge theories, isomonodromic deformations and $$W_N$$ fermions on the torus

2021 ◽  
Vol 111 (3) ◽  
Author(s):  
Giulio Bonelli ◽  
Fabrizio Del Monte ◽  
Pavlo Gavrylenko ◽  
Alessandro Tanzini
Keyword(s):  
Integrable System ◽  
Gauge Theories ◽  
The Self ◽  
Free Fermion ◽  
Two Dimensional ◽  
Isomonodromic Deformation ◽  
Specific Time ◽  
Dimensional Torus ◽  
Isomonodromic Deformations ◽  
Deformation Problem

AbstractWe study the relation between class $$\mathcal {S}$$ S theories on punctured tori and isomonodromic deformations of flat SL(N) connections on the two-dimensional torus with punctures. Turning on the self-dual $$\Omega $$ Ω -background corresponds to a deautonomization of the Seiberg–Witten integrable system which implies a specific time dependence in its Hamiltonians. We show that the corresponding $$\tau $$ τ -function is proportional to the dual gauge theory partition function, the proportionality factor being a nontrivial function of the solution of the deautonomized Seiberg–Witten integrable system. This is obtained by mapping the isomonodromic deformation problem to $$W_N$$ W N free fermion correlators on the torus.

Sign in / Sign up

Export Citation Format

Share Document