Lookahead processor allocation in mesh-connected massively parallel multicomputer

This paper proposes the lookahead idea in job allocation in a mesh-connected parallel processor, which has become popular in the design of massively parallel computers. The allocation heuristic can select its strategy by lookahead, i.e., looking into the queue of waiting jobs. This approach is shown to be superior to the existing heuristics which do not utilize any lookahead. For efficient implementation, we propose a compact rectangular set representation of the free submesh area which allows the complete submesh detection (also allocation) algorithm(s) to be an order of magnitude improved (in the average case) over the existing approach(es). The proposed representation is also beneficial when considering some currently unexplored issues in processor allocation and practitioner's approach.<<ETX>>

[1]  Kam-Hoi Cheng,et al.  Job Scheduling in Partitionable Mesh Connected Systems , 1989, ICPP.

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

[3]  Keqin Li,et al.  Static Job Scheduling in Partitionable Mesh Connected Systems , 1990, J. Parallel Distributed Comput..

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

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

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

[7]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.