Processor Scheduling in Multiprocessor Systems

Processor scheduling in multiprocessor systems can be divided into two steps. The first step, referred to as the processor allocation problem, is to determine the number of processors to be allocated to a job so as to maximize the system throughput and processor utilization. This depends both on the load on the system and on certain inherent characteristics of the job — most importantly how efficiently the job can utilize a given number of processors. The second step, referred to as the processor assignment problem, assigns processors to the parallel tasks in a job so as to minimize the execution time on the allocated processors. The processor assignment depends on the number of processor allocated, the processor interconnection structure, and the precedence relationship among the tasks in the job. This paper reviews the various issues in the above two steps of the processor scheduling.

[1]  Constantine D. Polychronopoulos,et al.  Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds , 1987, IEEE Transactions on Computers.

[2]  John K. Ousterhout,et al.  Scheduling Techniques for Concurrent Systems , 1982, ICDCS.

[3]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[4]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[5]  Manoj Kumar,et al.  Measuring Parallelism in Computation-Intensive Scientific/Engineering Applications , 1988, IEEE Trans. Computers.

[6]  Satish K. Tripathi,et al.  An analysis of several processor partitioning policies for parallel computers , 1991 .

[7]  Hironori Kasahara,et al.  Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing , 1984, IEEE Transactions on Computers.

[8]  Dipak Ghosal,et al.  Mapping Task Trees onto a Linear Array , 1991, International Conference on Parallel Processing.

[9]  Chien-Chung Shen,et al.  A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion , 1985, IEEE Trans. Computers.

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

[11]  Edward D. Lazowska,et al.  Speedup Versus Efficiency in Parallel Systems , 1989, IEEE Trans. Computers.

[12]  Anoop Gupta,et al.  Process control and scheduling issues for multiprogrammed shared-memory multiprocessors , 1989, SOSP '89.

[13]  Shahid H. Bokhari,et al.  On the Mapping Problem , 1981, IEEE Transactions on Computers.

[14]  Satish K. Tripathi,et al.  Task Allocation on the Hypercube Multiprocessor , 1990, International Conference on Parallel Processing.

[15]  Hironori Kasahara,et al.  Practical multiprocessor scheduling algorithms for efficient parallel processing , 1985, Systems and Computers in Japan.

[16]  Satish K. Tripathi,et al.  The Processor Working Set and Its Use in Scheduling Multiprocessor Systems , 1991, IEEE Trans. Software Eng..

[17]  John K. Ousterhout.  Scheduling Techniques for Concurrebt Systems. , 1982, ICDCS 1982.

[18]  Shikharesh Majumdar,et al.  Scheduling in multiprogrammed parallel systems , 1988, SIGMETRICS 1988.

[19]  Kenneth C. Sevcik.  Characterizations of parallelism in applications and their use in scheduling , 1989, SIGMETRICS '89.

[20]  Lawrence W. Dowdy,et al.  Dynamic partitioning in a transputer environment , 1990, SIGMETRICS '90.

[21]  T. C. Hu.  Parallel Sequencing and Assembly Line Problems , 1961 .

[22]  Mark S. Squillante,et al.  Analysis of Contention in Multiprocessor Scheduling , 1990, Performance.

[23]  Jake K. Aggarwal,et al.  A Mapping Strategy for Parallel Processing , 1987, IEEE Transactions on Computers.

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  Donald F. Towsley,et al.  A performance evaluation of several priority policies for parallel processing systems , 1993, JACM.

[26]  Lawrence W. Dowdy,et al.  Multiprogramming a Distributed-Memory Multiprocessor , 1989, Concurr. Pract. Exp..

[27]  Virgil D. Gligor,et al.  Properties of Multiprocessor Scheduling Algorithms , 1987, International Conference on Parallel Processing.