Communications of the ACM - Special section on computer architecture
Multigrid Algorithms on the Hypercube Multiprocessor
IEEE Transactions on Computers
Processor allocation in an N-cube multiprocessor using gray codes
IEEE Transactions on Computers
Topological Properties of Hypercubes
IEEE Transactions on Computers
On relaxed squashed embedding of graphs into a hypercube
SIAM Journal on Computing
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Communications of the ACM
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
A new approach to processor allocation and task migration in an N-cube multiprocessor
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
An optimal fault-tolerant broadcasting algorithm for a hypercube multiprocessor
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers
IEEE Transactions on Computers
On-Line Task Migration in Hypercubes Through Double Disjoint Paths
IEEE Transactions on Computers - Special issue on mobile computing
Allocation strategies for Ada tasks on hypercube multi-processors
TRI-Ada '90 Proceedings of the conference on TRI-ADA '90
Dynamic processor allocation in hypercube computers
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Allocating Precise Submeshes in Mesh Connected Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Allocation and deallocation of subcubes usually result in a fragmented hypercube where even if a sufficient number of hypercube nodes are available, they do not form a subcube large enough to execute an incoming task. As the fragmentation in conventional memory allocation can be handled by memory compaction, the fragmentation problem in a hypercube can be solved by task migration, i.e., relocating tasks within the hypercube to remove the fragmentation. The procedure for task migration closely depends on the subcube allocation strategy used, since active tasks must be relocated in such a way that the availability of subcubes can be detected by that allocation strategy.In this paper, we develop a task migration strategy for the subcube allocation policy based on the binary reflected Gray code. A goal configuration (of destination subcubes) without fragmentation is determined first. Then, the node-mapping between the source and destination subcubes is derived. Finally, a routing procedure to achieve shortest deadlock-free paths for relocating tasks is developed.