Communications of the ACM - Special section on computer architecture
Multigrid Algorithms on the Hypercube Multiprocessor
IEEE Transactions on Computers
Communication effect basic linear algebra computations on hypercube architectures
Journal of Parallel and Distributed Computing
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
Constructing Parallel Paths Between Two Subcubes
IEEE Transactions on Computers
Processor allocation for a class of hypercube-like supercomputers
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
On trading task reallocation for thread management in partitionable multiprocessors
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
IEEE Transactions on Parallel and Distributed Systems
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
A New Graph Approach to Minimizing Processor Fragmentation in Hypercube Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
An Efficient Processor Allocation Algorithm Using Two-dimensional Packing
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
On the (n,t)-antipodal Gray codes
Theoretical Computer Science
Mixed-Radix Gray Codes in Lee Metric
IEEE Transactions on Computers
Mathematical and Computer Modelling: An International Journal
| Hi-index | 14.99 |
Two important issues in managing processors in a hypercube are addressed: subcube allocation and task migration to eliminate the system fragmentation caused by allocation and deallocation of subcubes. It is proven that the subcube allocation strategy using a binary reflected Gray code (BRGC), called the GC strategy, possesses the best subcube recognition ability among all strategies using sequential searches. A binary code (BC) is defined as the binary representation of a nonnegative integer, and an extended binary code (EBC) is obtained by permutating the bits of a BC. Similarly, an extended Gray code (EGC) is obtained from a BRGC. The subcube recognition ability of an allocation strategy using multiple EBCs is analyzed and compared to that using multiple EGCs.