Job Scheduling Scheme for Pure Space Sharing Among Rigid Jobs

This paper evaluates the performance of job scheduling schemes for pure space sharing among rigid jobs. Conventional job scheduling schemes for the pure space sharing among rigid jobs have been achieved by First Come First Served (FCFS). However, FCFS has a drawback such that it can not utilize processors efficiently. This paper evaluates the performance of job scheduling schemes that are proposed to alleviate the drawback of FCFS by simulation, performance analysis and experiments on a real multiprocessor system. The results showed that Fit Processors First Served (FPFS), which searches the job queue and positively dispatches jobs that fit idle processors, was more effective and more practical than others.

[1]  Steven Hotovy,et al.  Workload Evolution on the Cornell Theory Center IBM SP2 , 1996, JSSPP.

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

[3]  Raj Vaswani,et al.  A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors , 1993, TOCS.

[4]  Mary K. Vernon,et al.  The performance of multiprogrammed multiprocessor scheduling algorithms , 1990, SIGMETRICS '90.

[5]  Keqin Li,et al.  Job Scheduling in a Partitionable Mesh Using a Two-Dimensional Buddy System Partitioning Scheme , 1991, IEEE Trans. Parallel Distributed Syst..

[6]  Larry Rudolph,et al.  Parallel Job Scheduling: Issues and Approaches , 1995, JSSPP.

[7]  David S. Johnson,et al.  Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .

[8]  David A. Lifka,et al.  The ANL/IBM SP Scheduling System , 1995, JSSPP.

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

[10]  Anoop Gupta,et al.  The impact of operating system scheduling policies and synchronization methods of performance of parallel applications , 1991, SIGMETRICS '91.

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

[12]  Honbo Zhou,et al.  The EASY - LoadLeveler API Project , 1996, JSSPP.

[13]  Thomas R. Gross,et al.  Impact of Job Mix on Optimizations for Space Sharing Schedulers , 1996, Proceedings of the 1996 ACM/IEEE Conference on Supercomputing.

[14]  Richard Gibbons,et al.  A Historical Application Profiler for Use by Parallel Schedulers , 1997, JSSPP.

[15]  Yu Inamura,et al.  Architecture of a parallel machine: Cenju-3 , 1995, Systems and Computers in Japan.

[16]  Peter W. Shor.  The average-case analysis of some on-line algorithms for bin packing , 1986, Comb..

[17]  笠原 博徳,et al.  OSCAR FORTRAN Compilerを用いたマルチグレイン並列性の評価 , 1998 .

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

[19]  Larry Rudolph,et al.  Towards Convergence in Job Schedulers for Parallel Supercomputers , 1996, JSSPP.

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

[21]  Rice UniversityCORPORATE,et al.  High performance Fortran language specification , 1993 .

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

[23]  Yahui Zhu,et al.  On Job Scheduling on a Hypercube , 1993, IEEE Trans. Parallel Distributed Syst..

[24]  Kenneth C. Sevcik,et al.  Implementing Multiprocessor Scheduling Disciplines , 1997, JSSPP.

[25]  Ray Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

[26]  Edward G. Coffman,et al.  Probabilistic analysis of packing and partitioning algorithms , 1991, Wiley-Interscience series in discrete mathematics and optimization.