On Task Relocation in Two-Dimensional Meshes

In parallel computer systems with a number of processors, external fragmentation is caused by continuous allocation and deallocation of processors to tasks which require exclusive use of several contiguous processors. With this condition, the system may not be able to find contiguous processors to be allocated to an incoming task even with a sufficient number of free processors. Relocation is an approach for alleviating this problem by reassigning the running tasks to other processors. In this paper, we examine two relocation schemes?full relocation and partial relocation scheme?for two-dimensional meshes. The full relocation scheme is desirable when the system is highly fragmented, while the partial relocation scheme is used for minimizing the number of relocated tasks. For the relocation process, we formally define and use two basic submesh movement operations?shifting and rotating. Comprehensive computer simulation reveals that the proposed schemes are beneficial when the relocation overhead is not high, which is machine dependent.

[1]  S. Lennart Johnsson,et al.  The Communication Efficiency fo Meshes, Boolean Cubes and Cube Connected Cycles for Wafer Scale Integraton , 1987, ICPP.

[2]  Nian-Feng Tzeng,et al.  A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers , 1992, IEEE Trans. Computers.

[3]  NitzbergBill,et al.  Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers , 1997 .

[4]  Hee Yong Youn,et al.  An Efficient Task Allocation Scheme for 2D Mesh Architectures , 1997, IEEE Trans. Parallel Distributed Syst..

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

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

[7]  Pinaki Mazumder,et al.  Evaluation of On-Chip Static Interconnection Networks , 1987, IEEE Transactions on Computers.

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

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

[10]  Bill Nitzberg,et al.  Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers , 1997, IEEE Trans. Parallel Distributed Syst..

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

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

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

[14]  Bin Cong,et al.  Scalable Parallel Computing: Technology, Architecture, Programming , 1999, Scalable Comput. Pract. Exp..

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