An adaptive job allocation method for multicomputer systems

The fragmentation problem in multicomputer systems reduces the system utilization and prohibits the systems from performing at their full capacity. In this paper, we propose a generic job allocation method for multicomputer systems based on job size reduction. We reduce the subsystem size requirement adaptively according to the availability of processors. The fragmentation problem is greatly alleviated by this approach. To ensure that the benefit of reducing fragmentation is not outweighed by the penalty of executing jobs on less number of processors, we restrict the number of times the size of a job can be reduced; hence the name restricted size reduction (RSR). Extensive simulations are conducted to validate the RSR method for hypercubes and mesh-based systems with different allocation algorithms. It is observed in both mesh and hypercube that by using the RSR method a simple algorithm can provide better performance than the more sophisticated allocation algorithms. We have also compared RSR method with the limit allocation that is based on a similar idea. Our method outperforms the limit allocation and provides better fairness to different size jobs. The performance gain, fairness, and low complexity makes the RSR method highly attractive.

[1]  Prasant Mohapatra,et al.  An integrated processor management scheme for the mesh-connected multicomputer systems , 1997, Proceedings of the 1997 International Conference on Parallel Processing (Cat. No.97TB100162).

[2]  John Zahorjan,et al.  Zahorjan processor allocation policies for message-passing parallel computers , 1994, SIGMETRICS 1994.

[3]  Chita R. Das,et al.  A Lazy Scheduling Scheme for Improving Hypercube Performance , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[4]  Chita R. Das,et al.  A Queuing Model for Finite-Buffered Multistage Interconnection Networks , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

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

[6]  Vara Varavithya,et al.  An EfficientFault-Tolerant Routing Scheme for Two Dimensional Meshes , 1995 .

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

[8]  Prasant Mohapatra,et al.  Performance study of RAID-5 disk arrays with data and parity cache , 1996, Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing.

[9]  Vara Varavithya,et al.  Routing Algorithms for Torus Networks , 1995 .

[10]  Prasant Mohapatra,et al.  Processor allocation using user directives in mesh-connected multicomputer systems , 1998, Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238).

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

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

[13]  Prasant Mohapatra,et al.  A hardware multicast routing algorithm for two-dimensional meshes , 1996, Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing.

[14]  Prasant Mohapatra,et al.  Dual-Crosshatch Disk Array: A Highly Reliable Hybrid-RAID Architecture , 1995, ICPP.

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

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

[17]  Prasant Mohapatra,et al.  On-line real-time task scheduling on partitionable multiprocessors , 1996, Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing.

[18]  G. Williger,et al.  National Science Foundation , 1962, American Antiquity.

[19]  Prasant Mohapatra,et al.  An efficient processor allocation scheme for mesh connected parallel computers , 1995, Proceedings.Seventh IEEE Symposium on Parallel and Distributed Processing.

[20]  Prasant Mohapatra,et al.  Tree-based multicasting on wormhole routed multistage interconnection networks , 1997, Proceedings of the 1997 International Conference on Parallel Processing (Cat. No.97TB100162).

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

[22]  Prasant Mohapatra,et al.  Efficient and balanced adaptive routing in two-dimensional meshes , 1995, Proceedings of 1995 1st IEEE Symposium on High Performance Computer Architecture.

[23]  Prasant Mohapatra,et al.  Stream scheduling algorithms for multimedia storage servers , 1998, Proceedings. 1998 International Conference on Parallel Processing (Cat. No.98EX205).

[24]  Chita R. Das,et al.  Performance Analysis of Combining Multistage Interconnection Networks , 1994, 1994 International Conference on Parallel Processing Vol. 1.

[25]  Prasant Mohapatra,et al.  An Adaptive Job Allocation Method for Directly-Connected Multicomputer Systems. , 1996, ICDCS 1996.

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

[27]  Chita R. Das,et al.  Limit Allocation: An Efficient Processor Management Scheme for Hypercubes , 1994, 1994 Internatonal Conference on Parallel Processing Vol. 2.

[28]  Chita R. Das,et al.  A Lazy Scheduling Scheme for Hypercube Computers , 1995, J. Parallel Distributed Comput..

[29]  Chita R. Das,et al.  Processor Management Techniques for Mesh-Connected Multiprocessors , 1995, ICPP.

[30]  Chita R. Das,et al.  Processor Allocation Using a Reservation Technique in Hypercube Computers , 1993 .

[31]  John P. Hayes,et al.  Subcube Allocation in Hypercube Computers , 1991, IEEE Trans. Computers.

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