X-Torus: A Variation of Torus Topology with Lower Diameter and Larger Bisection Width

Gu, Huaxi; Xie, Qiming; Wang, Kun; Zhang, Jie; Li, Yunsong

doi:10.1007/11751649_16

Cited by 5 publications

(15 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It also has many attractive properties such as smaller diameter, smaller average distance, larger bisection bandwidth and better scalability than the Torus and its variants [2].…”

Section: Torus Topologymentioning

confidence: 99%

“…It also retains advantages such as symmetric structure, constant degree and scalability of the Torus network. Therefore, new algorithms need to be formulated and tested for X-Torus that utilize these Cross Links in avoiding congestion and deadlocked channels; till now, only one Shortest path Algorithm is developed [2], which is very prone to congestion with huge traffic. The addition of Cross Links makes it a potentially efficient topology since it is a modification of Torus by addition of Cross Links, which in many ways improves the overall performance.…”

Section: Definition 13 Bisection Bandwidthmentioning

confidence: 99%

“…Below, in Sects. 3.1 and 3.2, formulas (1)(2)(3)(4) and (8)(9)(10)(11), respectively, have been developed to create an algorithm which utilizes Cross Links efficiently to overcome congestion issues, a shortcoming which existed in the previous Shortest path algorithm [2].…”

Section: X-torus Topology and Its Generalizationmentioning

confidence: 99%

“…Torus topology is a popular member among the Interconnection family of topologies, because of its symmetric structure, constant degree and scalability of network [2,6,11]. It has a wide area of applications in practical systems like Cray T3D, Cray T3E [3,7], Fujitsu AP3000, Ametak 2010 [4,7], Intel Touchstone [5,7] and so on.…”

Section: Torus Topologymentioning

confidence: 99%

“…Due to shorter diameter, shorter average distance and larger bisection bandwidth properties of the X-Torus topology [2], we chose the same for the implementation of Adaptive Load Balanced Routing (ALBR) algorithm and Dual Adaptive Routing (DAR) algorithm, it balances the load in the network both locally and globally; hence the name 'Dual'. The DAR algorithm has a blend of Oblivious Routing Algorithm and Adaptive Routing Algorithm and balances the load on the network on both global and local platforms.…”

Section: Definition 13 Bisection Bandwidthmentioning

confidence: 99%

See 4 more Smart Citations

On a deadlock and performance analysis of ALBR and DAR algorithm on X-Torus topology by optimal utilization of Cross Links and minimal lookups

Nitin

Vaish²,

Shrivastava

2010

J Supercomput

View full text Add to dashboard Cite

Interconnection networks play a major role in differentiating modern multiprocessor architectures. They can be categorized according to a number of criteria such as topology, routing strategy and switching technique. They are built up of switching elements; the topology is packaged such that it is cost effective along with its ability to achieve good performance. In this paper, we have studied an existing X-Torus topology (Gu et al. in ICCSA, LNCS, vol. 3984, pp. 149-157, 2006) which is an enhancement of a Torus network by adding Cross Links, and hence contributes to shorter diameter, shorter average distance and larger bisection bandwidth. Furthermore, we proposed the Adaptive Load Balanced Routing (ALBR) algorithm and Dual Adaptive Routing (DAR) algorithm.The ALBR algorithm can manage traffic during congestion by sensing the same through Channel Queues. The strength of the Algorithm lies in the fact that using backtracking, the number of lookups to reach destination through Cross Link decreases, thereby making optimal use of them. The Performance aspects for both Odd and Even forms of X-Torus are tested on Network Simulator-2 (NS-2) using Perl and Gawk for analyzing text of trace files generated during simulation.The DAR reduces the number of lookups by optimal utilization of Cross Links but also helps to curb the problem of packet congestion, which could be a major On a deadlock and performance analysis of ALBR and DAR 1253 issue in X-Torus due to the presence of Cross Links. In order to improve its rooting performance we have provided a new approach to handle the problem of deadlock detection and recovery mechanism in the case of X-Torus. The proposed progressive deadlock recovery mechanism takes advantage of the high path diversity of X-Torus. We also present a low cost and simple mechanism for deadlock detection as against many conservative mechanisms.

show abstract

“…It also has many attractive properties such as smaller diameter, smaller average distance, larger bisection bandwidth and better scalability than the Torus and its variants [2].…”

Section: Torus Topologymentioning

confidence: 99%

Section: Definition 13 Bisection Bandwidthmentioning

confidence: 99%

Section: X-torus Topology and Its Generalizationmentioning

confidence: 99%

Section: Torus Topologymentioning

confidence: 99%

Section: Definition 13 Bisection Bandwidthmentioning

confidence: 99%

See 3 more Smart Citations

On a deadlock and performance analysis of ALBR and DAR algorithm on X-Torus topology by optimal utilization of Cross Links and minimal lookups

Nitin

Vaish²,

Shrivastava

2010

J Supercomput

View full text Add to dashboard Cite

show abstract

Mathematical modelling for TM topology under uniform and hotspot traffic patterns

Moudi

Othman

2017

Automatika

View full text Add to dashboard Cite

Interconnection networks are introduced when dealing with the connection of a significant number of processors in massively parallel systems. TM topology is one of the latest interconnection networks to solve the deadlock problem and achieve high performance in massively parallel systems. This topology is derived from a Torus topology with removing cyclic channel dependencies. In this paper, we derive a mathematical model for TM topology under uniform and hotspot traffic patterns to compute the average delay. The average delay is formulated from the sum of the average delay of network, the average waiting time of the source node and the average degree of virtual channels. The results obtained from the mathematical model exhibit a close agreement with those predicted by simulation. In addition, sufficient simulation results are presented to revisit the TM topology performance under various traffic patterns.

show abstract

Virtualized I/O

Gavrilovska¹

2016

Attaining High Performance Communications

View full text Add to dashboard Cite

X-Torus: A Variation of Torus Topology with Lower Diameter and Larger Bisection Width

Cited by 5 publications

References 6 publications

On a deadlock and performance analysis of ALBR and DAR algorithm on X-Torus topology by optimal utilization of Cross Links and minimal lookups

On a deadlock and performance analysis of ALBR and DAR algorithm on X-Torus topology by optimal utilization of Cross Links and minimal lookups

Mathematical modelling for TM topology under uniform and hotspot traffic patterns

Virtualized I/O

Contact Info

Product

Resources

About