HEURISTIC SUBCUBE ALLOCATION WITH TASK MIGRATION IN HYPERCUBE SYSTEMS

In this paper, we propose a new top-down subcube allocation scheme, called HSA (Heuristic Subcube Allocation) strategy, and also present a task migration scheme to solve the fragmentation problem in a hypercube. An undirected graph, called SC (Subcube)-graph, whose vertices represent the available subcubes in the hypercube is used for the subcube allocation, and the higher dimension subcube is generated by the cycle detection using the SC-graph. When a subcube is released, a heuristic algorithm is used to maintain the available subcubes as large as possible and to reduce the response time. It is theoretically shown that the HSA strategy is not only statically optimal but also it has a complete subcube recognition capability in the dynamic environment. Extensive simulation results show that the HSA strategy improves the efficiency and significantly reduces the response time with a lower migration cost compared to the previously proposed schemes.