Processor allocation in an N-cube multiprocessor using gray codes
IEEE Transactions on Computers
Logic design of digital systems
Logic design of digital systems
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Hypercube management in the presence of node failures
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
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
Job Scheduling in Mesh Multicomputers
IEEE Transactions on Parallel and Distributed Systems
A Top-Down Processor Allocation Scheme for Hypercube Computers
IEEE Transactions on Parallel and Distributed Systems
A Unified Task-Based Dependability Model for Hypercube Computers
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
In hypercube computers that support a multiuser environment, it is important for the operating system to be able to allocate subcubes of different dimensions. Previously proposed subcube allocation schemes, such as the buddy strategy, may fragment the hypercube excessively. We present a precise characterization of the subcube allocation problem and develop a general methodology to solve it. New subcube allocation and coalescing algorithms are described that have the goal of minimizing fragmentation. The concept of a maximal set of subcubes (MSS), which is useful in making allocations that result in a tightly packed hypercube, is introduced. The problems of allocating subcubes and of forming an MSS are formulated as decision problems, and shown to be NP-hard. Optimal algorithms for allocating subcubes and for forming an MSS are given. We suggest a heuristic procedure for efficiently coalescing a released cube with the existing free cubes. Finally, we present simulation results comparing several different allocation and coalescing strategies, which show that our methods provide a marked performance improvement over previous techniques.