martes, 20 de febrero de 2018

Ficha del recurso:


Vínculo original en COMPUTER JOURNAL, 55 (6):769-775; 10.1093/comjnl/bxr135 JUN 2012
Bossard, A; Kaneko, K

Última actualización:

jueves, 28 de junio de 2012

Entrada en el observatorio:

jueves, 28 de junio de 2012



Archivado en:

The Set-to-Set Disjoint-Path Problem in Perfect Hierarchical Hypercubes

The perfect hierarchical hypercube (HHC) interconnection network has been introduced in the literature recently. An HHC can connect many nodes while retaining a low degree and a small diameter. It is thus a suitable topology for interconnection networks of massively parallel systems. We describe in this paper an algorithm solving the set-to-set disjoint-path routing problem in perfect HHCs. In an HHC2m+m, given two sets of m+1 nodes S and D, the proposed algorithm can find m+1 node-disjoint paths between the nodes of S and the nodes of D of lengths at most (m+1) (2(m) + m + 4) + 3 in O(m(2) 2(2m)) time complexity.