The performance of local and global scheduling strategies in multiprogrammed parallel systems

Based on analytic models this research concentrates on basic issues that are important in the context of processor scheduling in multiprogrammed parallel systems. Local scheduling policies for fork and join jobs are analyzed. Demonstration of the appropriate multiprogramming level, and the computation of the number of processors to be allocated to a job are investigated in the context of global scheduling. The global scheduling approach is static in the sense that a fixed set of processors is allocated to a job and dynamic processor switching from one application to another is not allowed. Important insights into system behavior that are useful in the context of operating systems for parallel systems are obtained as a result of this analysis. A number of basic issues that concern the relationship between job characteristics, system performance, and effective scheduling are discussed.<<ETX>>

[1]  Shikharesh Majumdar.  Processor scheduling in multiprogrammed parallel systems , 1988 .

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

[3]  Hisashi Kobayashi,et al.  Modeling and analysis , 1978 .

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

[5]  J. Little.  A Proof for the Queuing Formula: L = λW , 1961 .

[6]  Frank Bobrowicz,et al.  Speedup Predictions on Large Scientific Parallel Programs on Cray X MP Like Architectures , 1985, ICPP.

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

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

[9]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[10]  Asser N. Tantawi,et al.  Performance analysis of parallel processing systems , 1987, SIGMETRICS '87.

[11]  David L. Black,et al.  The duality of memory and communication in the implementation of a multiprocessor operating system , 1987, SOSP '87.

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

[13]  John Zahorjan,et al.  Processor scheduling in shared memory multiprocessors , 1990, SIGMETRICS '90.

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

[15]  Lawrence C. Stewart,et al.  Firefly: a multiprocessor workstation , 1987, ASPLOS 1987.