x-Folded TM: An efficient topology for interconnection networks

Moudi, Mehrnaz; Othman, Мohamed; Lun, Kweh Yeah; Rahiman, Amir Rizaan Abdul

doi:10.1016/j.jnca.2016.07.009

Cited by 18 publications

(7 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Eventually, x-Folded TM is illustrated in Figure 4. Considering the topology properties as basic requirements for each interconnection network, the properties of x-Folded TM topology proved the superiority of the x-Folded TM compared with the other topologies in [6]. As well as, Mesh, Torus and TM topologies, which are the latest topology in k-ary n-cube interconnection networks, are considered as a benchmark.…”

Section: Interconnection Topologiesmentioning

confidence: 99%

“…It makes an enthusiasm to solve the limitation and propose a novel topology with an efficient routing scheme to find the successful routes from each source to each destination without deadlock in interconnection networks. According to previous studies, we proposed a new topology in [6] for interconnection networks first. Then, the routing algorithm has been investigated in this topology [7,8].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On the relation between network throughput and delay curves

Moudi

Othman

2020

Automatika

Self Cite

View full text Add to dashboard Cite

The theoretical background of network throughput and delay has been widely used in the previous studies to efficiently study the behaviour of different interconnection networks. In this paper, we derive a new relationship between the network throughput and delay curves. Specifically, we prove that this relation on the average delay and throughput in x-Folded TM topology by considering the tangent line of each curve. Based on the achievements, we introduce the reflection relation between these two performance metrics, while considering the gradient of the metric curves. Moreover, we show the superiority of x-Folded TM topology, previously introduced with same authors, is obvious with this relation in interconnection networks. Consequently, the obtained results have been verified with simulation results to signify how to relate the performance metrics for various topologies in interconnection networks.

show abstract

Section: Interconnection Topologiesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

On the relation between network throughput and delay curves

Moudi

Othman

2020

Automatika

Self Cite

View full text Add to dashboard Cite

show abstract

“…As mentioned earlier, a low-dimensional network is better [16][17][18]. However, to interconnect millions of nodes, a conventional low-dimensional network is not suitable [19][20][21][22][23].…”

Section: Introductionmentioning

confidence: 99%

TFBN: A Cost Effective High Performance Hierarchical Interconnection Network

et al. 2020

View full text Add to dashboard Cite

In order to fulfill the increasing demand for computation power to process a boundless data concurrently within a very short time or real-time in many areas such as IoT, AI, machine learning, smart grid, and big data analytics, we need exa-scale or zetta-scale computation in the near future. Thus, to have this level of computation, we need a massively parallel computer (MPC) system that shall consist of millions of nodes; and, for the interconnection of these massive numbers of nodes, conventional topologies are infeasible. Thus, a hierarchical interconnection network (HIN) is a rational way to connect huge nodes. Through this article, we are proposing a new HIN, which is a tori-connected flattened butterfly network (TFBN) for the next generation MPC system. Numerous basic modules are hierarchically interconnected as a toroidal connection, whereby the basic modules are flattened butterfly networks. We have studied the network architecture, static network performance, and static cost-effectiveness of the proposed TFBN in detail; and compared static network and cost-effectiveness performance of the TFBN to those of TTN, torus, TESH, and mesh networks. It is depicted that TFBN possesses low diameter and average distance, high arc connectivity, and temperate bisection width. It also has better cost-effectiveness and cost-performance trade-off factor compared to those of TTN, torus, TESH, and mesh networks. The only shortcoming is that the complexity of wiring of the TFBN is higher than that of those networks; this is because the basic module necessitates some extra short length link to form the flattened butterfly network. Therefore, TFBN is a high performance and cost-effective HIN, and it will be a good option for the next generation MPC system.

show abstract

“…Although low dimensional networks are better in terms of their lesser delay and higher throughputs [7,8], they are not suitable for interconnecting millions of nodes for a hierarchical interconnection network (HIN) [9][10][11]. For next-generation systems of MPC, the interconnection of more than a million nodes, a combination of low-dimensional networks and the topology is required [12].…”

Section: Introductionmentioning

confidence: 99%

A Novel Tradeoff Analysis between Traffic Congestion and Packing Density of Interconnection Networks for Massively Parallel Computers

et al. 2021

View full text Add to dashboard Cite

From disaster prevention to mitigation, drug analysis to drug design, agriculture to food security, IoT to AI, and big data analysis to knowledge or sentiment mining, a high computation power is a prime necessity at present. As such, massively parallel computer (MPC) systems comprising a large number of nodes are gaining popularity. To interconnect these huge numbers of nodes efficiently, hierarchical interconnection networks are an attractive and feasible option. A Tori-connected flattened butterfly network (TFBN) has been proposed by the authors in a prior work for future generation MPC systems. In the previous study, the static network performance and static cost-effectiveness were evaluated. In this research, a novel trade-off factor named message traffic congestion vs. packing density trade-off factor has been proposed, which characterizes the message congestion in the network and its packing density. The factor is used to statically assess the suitability of the implementation of an interconnection network. The message traffic density, packing density, and new factor have been evaluated for the proposed network and similar competitive networks such as TTN, TESH, 2D-Mesh, 3D-Mesh, 2D-Torus, and 3D-Torus. It has been found that the performance of the TFBN is superior to the other networks.

show abstract

x-Folded TM: An efficient topology for interconnection networks

Cited by 18 publications

References 18 publications

On the relation between network throughput and delay curves

On the relation between network throughput and delay curves

TFBN: A Cost Effective High Performance Hierarchical Interconnection Network

A Novel Tradeoff Analysis between Traffic Congestion and Packing Density of Interconnection Networks for Massively Parallel Computers

Contact Info

Product

Resources

About