Fast and Efficient Strategies for Cubic and Non-Cubic Allocation in Hypercube Multiprocessors
- 1 August 1993
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (01903918) , 118-127
- https://doi.org/10.1109/icpp.1993.86
Abstract
A new approach for dynamic processor allo cation in hypercube multiprocessors which sup ports a multi-user environment is proposed. A dynamic binary tree is used for processor allo cation along with an array of free lists. Two al gorithms are proposed based on this approach that are capable of handling cubic as well as non-cubic allocation efficiently. The time com plexities for both allocation and deallocation are shown to be polynomial; orders of mag nitude improvement over the existing expo nential and even super-exponential algorithms. Unlike the existing strategies, the proposed strategies are best-fit strategies and do not ex cessively fragment the hypercube. Simulation results indicate that the proposed strategies outperform the existing ones in terms of pa rameters such as average delay in honoring a request, average allocation time and average deallocation time.Keywords
This publication has 9 references indexed in Scilit:
- A new strategy for processors allocation in an N-cube multiprocessorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A novel approach for subcube allocation in hypercube multiprocessorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Structural properties of incomplete hypercube computersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Dynamic processor allocation in hypercube computersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A top-down processor allocation scheme for hypercube computersIEEE Transactions on Parallel and Distributed Systems, 1991
- Incomplete hypercubesIEEE Transactions on Computers, 1988
- On allocating subcubes in a hypercube multiprocessorPublished by Association for Computing Machinery (ACM) ,1988
- Processor Allocation in an N-Cube Multiprocessor Using Gray CodesIEEE Transactions on Computers, 1987
- A fast storage allocatorCommunications of the ACM, 1965