On the wide container problem in a hypercube

摘要

Due to its simplicity, the hypercube topology is popular as interconnection network of massively parallel systems. Also, because the number of CPU nodes embedded in modern supercomputers is reaching new heights regularly, many advanced topologies using hy-percubes either as core elements, like clusters, or as high-level layers have been described in the literature. In this paper, we address the wide container problem in a hypercube. This problem consists of finding internally node-disjoint paths between a pair of nodes, such that each of all nodes of the hypercube is included in one of these paths. This is an important routing problem involving system dependability and it has many applications.