Dynamic processor allocation in hypercube computers

Authors:
Po-Jen Chuang;Nian-Feng Tzeng
Affiliations:
The Center for Advanced Computer Studies, University of Southwestern Louisiana, Lafayette, LA;The Center for Advanced Computer Studies, University of Southwestern Louisiana, Lafayette, LA
Venue:
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Year:
1990

Citing 6
Cited 7

The connection machine

The connection machine
A microprocessor-based hypercube supercomputer

IEEE Micro
Processor allocation in an N-cube multiprocessor using gray codes

IEEE Transactions on Computers
Topological Properties of Hypercubes

IEEE Transactions on Computers
Task migration in hypercube multiprocessors

ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
A fast storage allocator

Communications of the ACM

A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers

IEEE Transactions on Computers
Optimal and Suboptimal Processor Allocation for Hypercycle-based Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
Disjoint Task Allocation Algorithms for MIN Machines with Minimal Conflicts

IEEE Transactions on Parallel and Distributed Systems
An Efficient Task Allocation Scheme for 2D Mesh Architectures

IEEE Transactions on Parallel and Distributed Systems
A New Graph Approach to Minimizing Processor Fragmentation in Hypercube Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Distributed Subcube Management Scheme for Hypercube Multicomputer Systems

IEEE Transactions on Parallel and Distributed Systems
Processor Allocation in Hypercube Multicomputers: Fast and Efficient Strategies for Cubic and Noncubic Allocation

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

Fully recognizing various subcubes in a hypercube computer efficiently is nontrivial due to the specific structure of the hypercube. We propose a method with much less complexity than the multiple-GC strategy in generating the search space, while achieving complete subcube recognition. This method is referred to as a dynamic processor allocation scheme because the search space generated is dependent upon the dimension of the requested subcube dynamically, rather than being predetermined and fixed. The basic idea of this strategy lies in collapsing the binary tree representations of a hypercube successively so that the nodes which form a subcube but are distant would be brought close to each other for recognition. The strategy can be implemented efficiently by using shuffle operations on the leaf node addresses of binary tree representations. Extensive simulation runs are carried out to collect experimental performance measures of interest of different allocation strategies. It is shown from analytic and experimental results that this strategy compares favorably in many situations to any other known allocation scheme capable of achieving complete subcube recognition.