Communications of the ACM - Special section on computer architecture
Processor allocation in an N-cube multiprocessor using gray codes
IEEE Transactions on Computers
Topological Properties of Hypercubes
IEEE Transactions on Computers
The connection machine
Task migration in hypercube multiprocessors
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Dynamic processor allocation in hypercube computers
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Communications of the ACM
Processor Allocation in Hypercube Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Allocation and Mapping Based Reliability Analysis of Multistage Interconnection Networks
IEEE Transactions on Computers
Augmented Binary Hypercube: A New Architecture for Processor Management
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Contention-Free 2D-Mesh Cluster Allocation in Hypercubes
IEEE Transactions on Computers
Subcube Fault Tolerance in Hypercube Multiprocessors
IEEE Transactions on Computers
A Fault-Tolerant Routing Strategy in Hypercube Multicomputers
IEEE Transactions on Computers
Task migration in n-dimensional wormhole-routed mesh multicomputers
Journal of Systems Architecture: the EUROMICRO Journal
International Journal of High Performance Computing Applications
International Journal of High Performance Computing and Networking
Parallel computing on clusters and enterprise grids: practice and experience
International Journal of High Performance Computing and Networking
Execution environments and benchmarks for the study of applications’ scheduling on clusters
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
Task migration in all-port wormhole-routed 2D mesh multicomputers
Information Sciences: an International Journal
Hi-index | 15.00 |
Fully recognizing various subcubes in a hypercube computer efficiently is addressed. A method with much less complexity than the multiple-GC strategy in generating the search space, while achieving complete subcube recognition, is proposed. This method is referred to as a dynamic processor allocation scheme because the search space generated is dependent on the dimension of the requested subcube dynamically. The basic idea lies in collapsing the binary tree representations of a hypercube successively so that the nodes which form a subcube but are distant are brought close to each other for recognition. The strategy can be implemented efficiently by using right rotating operations on the notations of the sets of subcubes corresponding to the nodes at a certain level of binary tree representations. Results of extensive simulation runs carried out to collect performance measures for different allocation strategies are discussed. It is shown that this strategy compares favorably in most situations with other known allocation schemes capable of achieving complete subcube recognition.