Submesh Allocation in Mesh Multicomputers Using Busy-List: A BestFit Approach with Complete Recognition Capability

A new approach is proposed for dynamic submesh allocation in mesh-connected multicomputer system, which supports a multiuser environment. The proposed strategy effectively prunes the search space by searching for free submeshes on the corners of allocated (busy) submeshes along with the four corners of the mesh system. A submesh is selected with the potential of causing the least amount of fragmentation in the system. The proposed strategy possesses complete submesh recognition capability; it is a best-fit strategy, as well. Existing strategies do not provide this combination of capabilities. The deallocation time and memory overhead are shown to be constant in that they do not grow with the size of the mesh. To demonstrate effectiveness, the performance of the proposed strategy is compared against all existing schemes. Simulation results indicate that the proposed strategy outperforms existing ones in terms of parameters such as average delay in honoring a request, standard deviation of delay, average allocation time, average deallocation time, and amount of memory required. The proposed scheme achieves a 20 to 30% improvement in the average waiting delay over the best performing existing algorithm to date. Our scheme is shown to be applicable to torus-connected multicomputers as well, with only minor modifications. The scheme can also be used for submesh allocation with failures.

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

[2]  Allan Porterfield,et al.  The Tera computer system , 1990 .

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

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

[5]  Laxmi N. Bhuyan,et al.  An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected Systems , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[6]  T.E. Bell.  Supercomputers-beyond today's supercomputers , 1992, IEEE Spectrum.

[7]  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.

[8]  Debendra Das Sharma.  Space and time scheduling in multicomputers , 1995 .

[9]  Yahui Zhu,et al.  Efficient Processor Allocation Strategie for Mesh-Connected Parallel Computers , 1992, J. Parallel Distributed Comput..

[10]  G. Zorpette,et al.  Supercomputers-the power of parallelism , 1992 .

[11]  D. K. Kahaner,et al.  Supercomputing-Japan: a competitive assessment , 1992 .

[12]  Keqin Li,et al.  A Two-Dimensional Buddy System for Dynamic Resource Allocation in a Partitionable Mesh Connected System , 1991, J. Parallel Distributed Comput..

[13]  Kam-Hoi Cheng,et al.  A two dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system , 1990, CSC '90.

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

[15]  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.

[16]  Nian-Feng Tzeng,et al.  An efficient submesh allocation strategy for mesh computer systems , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[17]  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.