A methodology for the evaluation of multiprocessor non-preemptive allocation policies

bstract In this paper a methodology for the evaluation of non-preemptive adaptive policies for multiprogramming multiprocessor systems is proposed. An evaluation criterion is derived based on a systematic and consistent comparison of several allocation policies in a common framework. The comparison of the policies identifies the characteristic performance behavior of this type of policies. It suggests that equipartitioning strategies are an effective solution to the allocation problem when the workload components are statistically similar. The envelope of static equipartitioning policies (SEPs) is proposed as an evaluation criterion for non-preemptive adaptive policies. This criterion offers a guideline for the design of new policies and is useful in assessing the performance of existing ones. Analytical validation of the proposed criterion is presented for a simple case.

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

[2]  Satish K. Tripathi,et al.  Processor scheduling on multiprogrammed, distributed memory parallel computers , 1993, SIGMETRICS '93.

[3]  Eugenia Smirni.  Processor allocation and thread placement policies in parallel multiprocessor systems , 1995 .

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

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

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

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

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

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

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

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

[12]  Mark S. Squillante,et al.  Performance analysis of job scheduling policies in parallel supercomputing environments , 1993, Supercomputing '93. Proceedings.

[13]  Giuseppe Serazzi,et al.  Robust Partitioning Policies of Multiprocessor Systems , 1994, Perform. Evaluation.

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

[15]  Kenneth C. Sevcik,et al.  Application Scheduling and Processor Allocation in Multiprogrammed Parallel Processing Systems , 1994, Perform. Evaluation.

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

[17]  Tim Brecht,et al.  Processor-pool-based scheduling for large-scale NUMA multiprocessors , 1991, SIGMETRICS '91.

[18]  Leonard Kleinrock,et al.  Power and deterministic rules of thumb for probabilistic problems in computer communications , 1979 .