Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
Total Exchange Routing on Hierarchical Dual-Nets
verfasst von : Yamin Li, Wanming Chu
Erschienen in: Network and Parallel Computing
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The hierarchical dual-net (HDN) is a newly proposed interconnection network for massive parallel computers. The HDN is constructed based on a symmetric product graph (base network). A
k
-level hierarchical dual-net, HDN(
B
,
k
,
S
), contains
$n_k=(2n_0)^{2^k}/(2\prod_{i=1}^{k}s_i)$
nodes, where
S
= {
G
′
1
,
G
′
2
,…,
G
′
k
},
G
′
i
is a super-node and
s
i
= |
G
′
i
| is the number of nodes in the super-node at the level
i
for 1 ≤
i
≤
k
, and
n
0
is the number of nodes in the base network
B
. The
S
is used mainly for adjusting the scale of the system. The node degree of HDN(
B
,
k
,
S
) is
d
0
+
k
, where
d
0
is the node degree of the base network. The HDN is node and edge symmetric and can contain huge number of nodes with small node-degree and short diameter. The total exchange is one of the most dense communication patterns and is at the heart of numerous applications and programming models in parallel computing. In this paper, we show that the total exchange routing can be done on HDN efficiently.