Isomorphic Allocation in k-ary n-cube Systems

摘要

Due to its topological generality and flexibility, the k-ary n-cube architecture is actively researched exploring network design trade-offs as well as characterizing the topology. Processor allocation problem, which has been extensively attempted for hypercubes and meshes, however, has not been addressed for the k-ary n-cube parallel computers. In this paper, we propose Isomorphic Partitioning, where a partitioned subcube retains the high order of dimension of the whole system but with smaller size in each dimension. The partitioned subcubes maintain the advantages of the high order architecture. Extensive simulation reveals the effectiveness of the proposed scheme based on the Isomorphic Partitioning.