Processor allocation and reallocation strategy for circuit-switched hypercube

초록

In the paper, we propose a processor allocation algorithm using the PGG(Packed Gray Group)for MIND hypercube. If we empoly the PGG in the processor allocation C(n,k) PGG's, which is equivalent to the number of k-D subcubes, are required to recognize all the k-D subcubes in an n-cube. From the simulation we find that the capability of processor allocation using only 40% of C(n,k) PGG's is about the same as that of the allocation using all the PGG's. We also propose processor reallocation algorithm in the circuit-switched hypercube to eliminate the fragmentation which is caused by the repeated allcation and de-allocation of subcubes. In the processor reallocation algorithm, we find a set of dedicated edge-disjiont routing paths for each node from a subcube which is allocated for a task to a subcube in fragmentation. The algorithm is based on the PGG which detects all kinds Gray codes.