A new processor allocation strategy with a high degree of contiguity in mesh-connected multicomputers

Abstract Relaxing the contiguity condition in non-contiguous allocation can reduce processor fragmentation and increase processor utilization. However, communication overhead could increase due to the potential increase in message distances. The communication overhead depends on how the allocation request is partitioned and allocated to free sub-meshes. In this paper, a new non-contiguous processor allocation strategy, referred to as Greedy-Available-Busy-List (GABL for short), is suggested for the mesh network, and is compared against the existing non-contiguous and contiguous allocation strategies. To demonstrate the performance gains achieved by our proposed strategy, we have conducted simulation runs under the assumption of wormhole routing technique. The results have revealed that the new strategy can reduce communication overhead and considerably improve performance in terms of the job turnaround time, system utilization, and jobs finish time.

[1]  Satoshi Hirano,et al.  Multi-tasking Method on Parallel Computers which Combines a Contiguous and Non-contiguous Processor Partitioning Algorithm , 1996, PARA.

[2]  José E. Moreira,et al.  Open Job Management Architecture for the Blue Gene/L Supercomputer , 2005, JSSPP.

[3]  Kurt Windisch,et al.  Non-contiguous Processor Allocation Algorithms for Mesh-connected Multicomputers 1 , 1994 .

[4]  J. A. Davis,et al.  Program-based static allocation policies for highly parallel computers , 1995, Proceedings International Phoenix Conference on Computers and Communications.

[5]  Nian-Feng Tzeng,et al.  Allocating Precise Submeshes in Mesh Connected Systems , 1994, IEEE Trans. Parallel Distributed Syst..

[6]  Chita R. Das,et al.  A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers , 2002, IEEE Trans. Computers.

[7]  Kyung-Hee Seo.  Fragmentation-efficient node allocation algorithm in 2D mesh-connected systems , 2005, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05).

[8]  Ge-Ming Chiu,et al.  An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead , 1999, IEEE Trans. Parallel Distributed Syst..

[9]  Ismail Ababneh.  An efficient free-list submesh allocation scheme for two-dimensional mesh-connected multicomputers , 2006, J. Syst. Softw..

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

[11]  James Sutton,et al.  iWarp: a 100-MOPS, LIW microprocessor for multicomputers , 1991, IEEE Micro.

[12]  Philip Heidelberger,et al.  IBM Research Report Design and Analysis of the BlueGene/L Torus Interconnection Network , 2003 .

[13]  Jie Chen,et al.  Efficient subtorus processor allocation in a multi-dimensional torus , 2005, Eighth International Conference on High-Performance Computing in Asia-Pacific Region (HPCASIA'05).

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

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

[16]  T. Srinivasan,et al.  A Minimal Fragmentation Algorithm for Task Allocation in Mesh-Connected Multicomputers , 2004 .

[17]  Saad Bani-Mohammad,et al.  Non-contiguous processor allocation strategy for 2D mesh connected multicomputers based on sub-meshes available for allocation , 2006, 12th International Conference on Parallel and Distributed Systems - (ICPADS'06).

[18]  Prasant Mohapatra,et al.  Performance Improvement of Allocation Schemes for Mesh-Connected Computers , 1998, J. Parallel Distributed Comput..

[19]  P. McKinley,et al.  Deadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers Deadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers , 1992 .

[20]  Virginia Mary Lo,et al.  ProcSimity: an experimental tool for processor allocation and scheduling in highly parallel systems , 1995, Proceedings Frontiers '95. The Fifth Symposium on the Frontiers of Massively Parallel Computation.