Processor Allocation in Hypercube Multicomputers: Fast and Efficient Strategies for Cubic and Noncubic Allocation

A new approach for dynamic processor allocation in hypercube multicomputers which supports a multi-user environment is proposed. A dynamic binary tree is used for processor allocation along with an array of free lists. Two algorithms are proposed based on this approach, capable of efficiently handling cubic as well as noncubic allocation. Time complexities for both allocation and deallocation are shown to be polynomial, a significant improvement over the existing exponential and even super-exponential algorithms. Unlike existing schemes, the proposed strategies are best-fit strategies within their search space. Simulation results indicate that the proposed strategies outperform the existing ones in terms of parameters such as average delay in honoring a request, average allocation time, average deallocation time, and memory overhead. >

[1]  Kenneth C. Knowlton,et al.  A fast storage allocator , 1965, CACM.

[2]  Nian-Feng Tzeng,et al.  Dynamic processor allocation in hypercube computers , 1990, [1990] Proceedings. The 17th Annual International Symposium on Computer Architecture.

[3]  Dhiraj K. Pradhan,et al.  Subcube Level Time-Sharing in Hypercube Multicomputers , 1994, 1994 Internatonal Conference on Parallel Processing Vol. 2.

[4]  Sara Baase,et al.  Computer algorithms - introduction to design and analysis (2 ed.) , 1988 .

[5]  Dhiraj K. Pradhan,et al.  Job Scheduling in Mesh Multicomputers , 1994, 1994 Internatonal Conference on Parallel Processing Vol. 2.

[6]  B. Bose,et al.  A new strategy for processors allocation in an N-cube multiprocessor , 1989, Eighth Annual International Phoenix Conference on Computers and Communications. 1989 Conference Proceedings.

[7]  J. Kim,et al.  A Top-Down Processor Allocation Scheme for Hypercube Computers , 1991, IEEE Trans. Parallel Distributed Syst..

[8]  Kishor S. Trivedi.  Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .

[9]  J. P. Hayes,et al.  On allocating subcubes in a hypercube multiprocessor , 1988, C3P.

[10]  Dhiraj K. Pradhan,et al.  A fast and efficient strategy for submesh allocation in mesh-connected parallel computers , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.

[11]  Ming-Syan Chen,et al.  Processor Allocation in an N-Cube Multiprocessor Using Gray Codes , 1987, IEEE Transactions on Computers.

[12]  Chita R. Das,et al.  A Processor Allocation Scheme for Hypercube Computers , 1989, ICPP.

[13]  K. G. Shin,et al.  Task migration in hypercube multiprocessors , 1989, ISCA '89.

[14]  Qing Yang,et al.  Prime Cube Graph Approach for Processor Allocation in Hypercube Multiprocessors , 1991, ICPP.

[15]  Ming-Syan Chen,et al.  Subcube Allocation and Task Migration in Hypercube Multiprocessors , 1990, IEEE Trans. Computers.

[16]  Phillip Krueger,et al.  Processor allocation vs. job scheduling on hypercube computers , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[17]  Magdy A. Bayoumi,et al.  A Parallelized Algorithm for the All-Row Preconditioned Interval Newton/Generalized Bisection Method , 1991, PPSC.

[18]  Ellis Horowitz,et al.  Fundamentals of Data Structures in Pascal , 1984 .

[19]  Dhiraj K. Pradhan,et al.  A novel approach for subcube allocation in hypercube multiprocessors , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.

[20]  Dhiraj K. Pradhan,et al.  Fast and Efficient Strategies for Cubic and Non-Cubic Allocation in Hypercube Multiprocessors , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[21]  Nian-Feng Tzeng,et al.  Embeddings in Incomplete Hypercubes , 1990, ICPP.