A modified diagonal mesh interconnection network

Punhani, Akash; Nitin, Nitin; Kumar, Pardeep

doi:10.1109/indicon.2014.7030606

Cited by 8 publications

(9 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The DMESH was also having a lot of variants proposed by the various researchers [16][17][18][19]. Here, we suggested the modification on the MDMIN [5] as variant of diagonal mesh described in the Figure 4. The MDMIN is having the horizontal and vertical link connections over the boundaries nodes and the diagonal nodes on the interior nodes.…”

Section: Diagonal Mesh Interconnection Network (Dmesh)mentioning

confidence: 99%

“…They had increased the cost of the hardware and not works for all values of "n". In the paper [5], the modified diagonal mesh interconnection network (MDMIN) has proposed and removed the torodial links. The detail analysis of the traffic suitable for this type of topology had not been suggested in the paper [5].…”

Section: Introductionmentioning

confidence: 99%

“…In the paper [5], the modified diagonal mesh interconnection network (MDMIN) has proposed and removed the torodial links. The detail analysis of the traffic suitable for this type of topology had not been suggested in the paper [5]. In this paper, we have identify the ideal traffic for the MDMIN and also propose a new variant based on MDMIN that is modified diagonal mesh with shuffle exchange network.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Modified Diagonal Mesh Shuffle Exchange Interconnection Network

Punhani¹,

Kumar²,

Nitin³

2017

IJECE

Self Cite

View full text Add to dashboard Cite

Interconnection network is an important part of the digital system. The interconnection mainly describes the topology of the network along with the routing algorithm and flow control mechanism. The topology of the network plays an important role on the performance of the system. Mesh interconnection network was the simplest topology, but has the limited bisection bandwidth on the other hand torus and diagonal mesh was having long links. The Modified diagonal mesh network tried to replace the torodial links but was having more average path length so in proposed topology we have tried to improve the average distance using shuffle exchange network over the boundary node. In this paper, we propose the architecture of Modified Diagonal Mesh Shuffle Exchange Interconnection Network. This Modified Diagonal Mesh Shuffle Exchange Interconnection network have been compared with four popular topologies that are simple 2D Mesh, 2D Torus, Diagonal Mesh and Modified Diagonal Mesh Interconnection Network on the four traffic patterns such as Bit Complement traffic, Neighbor traffic, Tornado traffic and Uniform traffic are used for comparisonand performance analysis. We have performed the analysis with a 5% and 10% of hotspot on the Uniform Traffic. The simulation results shows that the proposed topology is performed better on bit complement traffic and can also handle the other traffic up to certain level.

show abstract

Section: Diagonal Mesh Interconnection Network (Dmesh)mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Modified Diagonal Mesh Shuffle Exchange Interconnection Network

Punhani¹,

Kumar²,

Nitin³

2017

IJECE

Self Cite

View full text Add to dashboard Cite

show abstract

“…Hence, it is used in the design of various parallel machines such as Alpha 21364-based HPGS 1280 [4], Cray XT3 [11] and XT4 [12], X1E [13], Cray X1-E vector computer [14]. Moreover, IBM Blue Gene family of massively parallel computers are some remarkable examples of mixed Radix 3D Tori [30][31][32]. In order to decrease very large diameter of the torus, a new class of recursively structured torus connections networks called recursive diagonal torus (RDT) has been proposed in [22].The discussion carried out so far reveals that the torus has a fixed degree but has a relatively large diameter (2n).…”

Section: Introductionmentioning

confidence: 99%

A New Cost Effective and Reliable Interconnection Topology for Parallel Computing Systems

Tripathy¹,

Dash²,

Tripathy³

2019

IJEAT

View full text Add to dashboard Cite

Topology of the of interconnection network is one of the most important considerations in the design of parallel systems as it is the backbone network over which the different components of the computer communicate with each other. The properties of the topology such as connectivity, reliability, cost, fault tolerance, diameter and bisection width determine the flawless-less data transmission between the source and the sink nodes. In this paper, we propose a new hybrid interconnection network topology called TOR-CUBE (TC) which is a product of two classical popular interconnection topologies namely hypercube and torus. Further, we show the construction and characteristics of the proposed interconnection topology. We also presented some basic important properties and formulated two routing algorithms for TC. Our results show that the proposed interconnection topology has high connectivity, lesser diameter, low cost, fault tolerant, scalable and low average distance. The different reliability measures of TC are computed and found to be better as compared with its counterpart topologies and the parent topologies.

show abstract

“…The various variants of the mesh topologies [8][9][10][11][12][13][14][15][16] has been suggested in the past; that proves to be more efficient than Mesh topology and have used the routing derived from the XY Routing algorithm. This makes a point to study the XY routing in details because the study will not only support mesh topology, but it forms the bases for designing the Routing algorithm for the variants of the mesh topology.…”

Section: Introductionmentioning

confidence: 99%

Level Based Routing Using Dynamic Programming for 2D Mesh

Punhani

Kumar

Nitin

2017

Cybernetics and Information Technologies

Self Cite

View full text Add to dashboard Cite

The performance of the interconnection network doesn't only depend on the topology, but it also depends on the Routing algorithm used. The simplest Routing algorithm for the mesh topology in networks on chip is the XY Routing algorithm. The level based Routing algorithm has been proved to be more efficient than the XY Routing algorithm. In this paper, level based Routing algorithm using the dynamic programming has been proposed. The proposed Routing algorithm proves to be more efficient in the terms of the computation. The proposed Routing algorithm has achieved up to two times bigger speed.

show abstract

A modified diagonal mesh interconnection network

Cited by 8 publications

References 6 publications

A Modified Diagonal Mesh Shuffle Exchange Interconnection Network

A Modified Diagonal Mesh Shuffle Exchange Interconnection Network

A New Cost Effective and Reliable Interconnection Topology for Parallel Computing Systems

Level Based Routing Using Dynamic Programming for 2D Mesh

Contact Info

Product

Resources

About