The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Les réseaux d'interconnexion jouent un rôle crucial dans les performances des ordinateurs massivement parallèles. Les réseaux d'interconnexion hiérarchiques offrent des performances élevées à faible coût en explorant la localité qui existe dans les modèles de communication des ordinateurs massivement parallèles. UN Tori connecté Torus Nréseau (TTN) est un réseau de tores 2D composé de plusieurs modules de base, dans lequel les modules de base sont des réseaux de tores 2D interconnectés hiérarchiquement pour les réseaux de niveau supérieur. Cet article aborde les détails architecturaux du TTN et explore des aspects tels que le degré de nœud, le diamètre du réseau, le coût, la distance moyenne, la connectivité de l'arc, la largeur de la bissection et la complexité du câblage. Nous présentons également un algorithme de routage sans blocage pour le TTN utilisant quatre canaux virtuels et évaluons les performances de communication dynamique du réseau à l'aide de l'algorithme de routage proposé sous des modèles de trafic uniformes et divers non uniformes. Nous évaluons les performances de communication dynamique des réseaux TTN, TESH, MH3DT, maillés et torus par simulation informatique. Il est démontré que le TTN possède plusieurs caractéristiques attrayantes, notamment un degré de nœud constant, un petit diamètre, un faible coût, une petite distance moyenne, une largeur de bissection modérée (ni trop faible, ni trop élevée), un débit élevé et une très faible latence de charge nulle, ce qui offrent de meilleures performances de communication dynamique que celles des autres réseaux conventionnels et hiérarchiques.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
M.M. Hafizur RAHMAN, Yasushi INOGUCHI, Yukinori SATO, Susumu HORIGUCHI, "TTN: A High Performance Hierarchical Interconnection Network for Massively Parallel Computers" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 5, pp. 1062-1078, May 2009, doi: 10.1587/transinf.E92.D.1062.
Abstract: Interconnection networks play a crucial role in the performance of massively parallel computers. Hierarchical interconnection networks provide high performance at low cost by exploring the locality that exists in the communication patterns of massively parallel computers. A Tori connected Torus Network (TTN) is a 2D-torus network of multiple basic modules, in which the basic modules are 2D-torus networks that are hierarchically interconnected for higher-level networks. This paper addresses the architectural details of the TTN and explores aspects such as node degree, network diameter, cost, average distance, arc connectivity, bisection width, and wiring complexity. We also present a deadlock-free routing algorithm for the TTN using four virtual channels and evaluate the network's dynamic communication performance using the proposed routing algorithm under uniform and various non-uniform traffic patterns. We evaluate the dynamic communication performance of TTN, TESH, MH3DT, mesh, and torus networks by computer simulation. It is shown that the TTN possesses several attractive features, including constant node degree, small diameter, low cost, small average distance, moderate (neither too low, nor too high) bisection width, and high throughput and very low zero load latency, which provide better dynamic communication performance than that of other conventional and hierarchical networks.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.1062/_p
Copier
@ARTICLE{e92-d_5_1062,
author={M.M. Hafizur RAHMAN, Yasushi INOGUCHI, Yukinori SATO, Susumu HORIGUCHI, },
journal={IEICE TRANSACTIONS on Information},
title={TTN: A High Performance Hierarchical Interconnection Network for Massively Parallel Computers},
year={2009},
volume={E92-D},
number={5},
pages={1062-1078},
abstract={Interconnection networks play a crucial role in the performance of massively parallel computers. Hierarchical interconnection networks provide high performance at low cost by exploring the locality that exists in the communication patterns of massively parallel computers. A Tori connected Torus Network (TTN) is a 2D-torus network of multiple basic modules, in which the basic modules are 2D-torus networks that are hierarchically interconnected for higher-level networks. This paper addresses the architectural details of the TTN and explores aspects such as node degree, network diameter, cost, average distance, arc connectivity, bisection width, and wiring complexity. We also present a deadlock-free routing algorithm for the TTN using four virtual channels and evaluate the network's dynamic communication performance using the proposed routing algorithm under uniform and various non-uniform traffic patterns. We evaluate the dynamic communication performance of TTN, TESH, MH3DT, mesh, and torus networks by computer simulation. It is shown that the TTN possesses several attractive features, including constant node degree, small diameter, low cost, small average distance, moderate (neither too low, nor too high) bisection width, and high throughput and very low zero load latency, which provide better dynamic communication performance than that of other conventional and hierarchical networks.},
keywords={},
doi={10.1587/transinf.E92.D.1062},
ISSN={1745-1361},
month={May},}
Copier
TY - JOUR
TI - TTN: A High Performance Hierarchical Interconnection Network for Massively Parallel Computers
T2 - IEICE TRANSACTIONS on Information
SP - 1062
EP - 1078
AU - M.M. Hafizur RAHMAN
AU - Yasushi INOGUCHI
AU - Yukinori SATO
AU - Susumu HORIGUCHI
PY - 2009
DO - 10.1587/transinf.E92.D.1062
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2009
AB - Interconnection networks play a crucial role in the performance of massively parallel computers. Hierarchical interconnection networks provide high performance at low cost by exploring the locality that exists in the communication patterns of massively parallel computers. A Tori connected Torus Network (TTN) is a 2D-torus network of multiple basic modules, in which the basic modules are 2D-torus networks that are hierarchically interconnected for higher-level networks. This paper addresses the architectural details of the TTN and explores aspects such as node degree, network diameter, cost, average distance, arc connectivity, bisection width, and wiring complexity. We also present a deadlock-free routing algorithm for the TTN using four virtual channels and evaluate the network's dynamic communication performance using the proposed routing algorithm under uniform and various non-uniform traffic patterns. We evaluate the dynamic communication performance of TTN, TESH, MH3DT, mesh, and torus networks by computer simulation. It is shown that the TTN possesses several attractive features, including constant node degree, small diameter, low cost, small average distance, moderate (neither too low, nor too high) bisection width, and high throughput and very low zero load latency, which provide better dynamic communication performance than that of other conventional and hierarchical networks.
ER -