Node-disjoint paths in a level block of generalized hierarchical completely connected networks

Node-disjoint paths in a level block of generalized hierarchical completely connected networks
复制标题

DOI:
10.1016/j.tcs.2012.09.016
复制
发表时间:
2012-12
期刊:
Theor. Comput. Sci.
影响因子:
--
通讯作者:
T. Takabatake;Tomoki Nakamigawa
T. Takabatake;Tomoki Nakamigawa
中科院分区:
其他
文献类型:
--
作者:
T. Takabatake;Tomoki Nakamigawa

文献摘要

相似文献

已经提出了广义的分层完全连接网络(简称HCC),其包括传统的分层网络。 HCC 是大规模并行计算机系统的网络拓扑。为了有效地将HCC应用于并行计算机系统并在HCC上有效地执行数据处理,必须揭示HCC固有的容错特性。然而,这些性质尚未得到充分阐明。在本文中,针对 HCC 的级别块验证了节点不相交路径。
Generalized hierarchical completely connected networks (for short, HCCs), which include conventional hierarchical networks, have been proposed. An HCC is a network topology for a massively parallel computer system. To apply an HCC to a parallel computer system effectively and to execute data processing on the HCC efficiently, the inherent fault-tolerant properties in an HCC must be revealed. However, these properties have not been clarified sufficiently. In this paper, node-disjoint paths are verified for a level block of the HCC.