333 research outputs found
Topology Architecture and Routing Algorithms of Octagon-Connected Torus Interconnection Network
Two important issues in the design of interconnection networks for massively parallel computers are scalability and small diameter. A new interconnection network topology, called octagon-connected torus (OCT), is proposed. The OCT network combines the small diameter of octagon topology and the scalability of torus topology. The OCT network has better properties, such as small diameter, regular, symmetry and the scalability. The nodes of the OCT network adopt the Johnson coding scheme which can make routing algorithms simple and efficient. Both unicasting and broadcasting routing algorithms are designed for the OCT network, and it is based on the Johnson coding scheme. A detailed analysis shows that the OCT network is a better interconnection network in the properties of topology and the performance of communication
Hierarchical 3D-Mesh Network
A Hierarchical 3D-Mesh (H3DM) Network is a 2D-mesh network of multiple basic modules, in which the basic modules are 3D-torus
networks that are hierarchically interconnected for higher-level networks. In this paper, we evaluate the dynamic communication
performance of a H3DM network using a deadlock-free routing algorithm with minimum number of virtual channels under the uniform
and non-uniform traffic patterns; and compare it with other networks to show the superiority of the H3DM network over other networks. We have also evaluated the dynamic communication performance of the mesh and torus networks. It is shown that H3DM network yields low average transfer time than that of mesh and torus networks. The trade-off between throughput and latency of these networks shown
that H3DM network provide better dynamic communication performance than that of mesh and torus networks before saturation
Constructing virtual 5-dimensional tori out of lower-dimensional network cards
[EN] In the Top500 and Graph500 lists of the last years, some of the most powerful systems implement
a torus topology to interconnect themillions of computing nodes they include. Some of these torus
networks are of five or six dimensions, which implies an additional difficulty as the node degree
increases. In previous works, we proposed and evaluated the nD Twin (nDT) torus topology to virtually
increase the dimensions a torus is able to implement. We showed that this new topology
reduces the distances between nodes, increasing, therefore, global network performance. In this
work, we present how to build a 5DT torus network using a specific commercial 6-port network
card (EXTOLL card) to interconnect those nodes. We show, using the same number of cards, that
the performance of the 5DT torus network we are able to implement using our proposal is higher
than the performance of the 3D torus network for the same number of compute nodes.Spanish MINECO; European Commission, Grant/Award Number: TIN2015-66972-C5-1-R and TIN2015-66972-C5-2-R; JCCM, Grant/Award Number: PEII-2014-028-P; Spanish MICINN, Grant/Award Number: FJCI-2015-26080AndĂşjar-Muñoz, FJ.; Villar, JA.; Sanchez Garcia, JL.; Alfaro Cortes, FJ.; Duato MarĂn, JF.; Fröning, H. (2017). Constructing virtual 5-dimensional tori out of lower-dimensional network cards. Concurrency and Computation Practice and Experience. 1-17. https://doi.org/10.1002/cpe.4361S11
- …