Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
