Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free access

Processor scheduling in shared memory multiprocessors

Published: 01 April 1990 Publication History

Abstract

Existing work indicates that the commonly used “single queue of runnable tasks” approach to scheduling shared memory multiprocessors can perform very poorly in a multiprogrammed parallel processing environment. A more promising approach is the class of “two-level schedulers” in which the operating system deals solely with allocating processors to jobs while the individual jobs themselves perform task dispatching on those processors.
In this paper we compare two basic varieties of two-level schedulers. Those of the first type, static, make a single decision per job regarding the number of processors to allocate to it. Once the job has received its allocation, it is guaranteed to have exactly that number of processors available to it whenever it is active. The other class of two-level scheduler, dynamic, allows each job to acquire and release processors during its execution. By responding to the varying parallelism of the jobs, the dynamic scheduler promises higher processor utilizations at the cost of potentially greater scheduling overhead and more complicated application level task control policies.
Our results, obtained via simulation, highlight the tradeoffs between the static and dynamic approaches. We investigate how the choice of policy is affected by the cost of switching a processor from one job to another. We show that for a wide range of plausible overhead values, dynamic scheduling is superior to static scheduling. Within the class of static schedulers, we show that, in most cases, a simple “run to completion” scheme is preferable to a round-robin approach. Finally, we investigate different techniques for tuning the allocation decisions required by the dynamic policies and quantify their effects on performance.
We believe our results are directly applicable to many existing shared memory parallel computers, which for the most part currently employ a simple “single queue of tasks” extension of basic sequential machine schedulers. We plan to validate our results in future work through implementation and experimentation on such a system.

References

[1]
K. Almquist, R.J. Anderson, and E.D. Lazowska. The Measured Performance of Parallel Dynamic Programming Implementations. Proc. 1989 Intl. Conf. on Par. Proc. (Aug. 1989).
[2]
G.M. Amdahl. Validity of the Single Processor Approach to Achieving Large-Scale Computing Capabilities. Proc. AFIPS 30 (1967).
[3]
Edward G. Coffman, Jr., and Leonard Kleinrock. Computer Scheduling Methods and their Countermeasures. Proc. 1968 Spring Joint Computer Conference, pp. 11-21.
[4]
Derek L. Eager, John Zahorjan, and Edward D. Lazowska. Speedup Versus Efficiency in Parallel Systems. IEEE Trans. on Comp. C- 38,3 (March 1989).
[5]
R.L. Graham. Bounds for Certain Multiprocessing Anomalies. Bell Syst. Tech. J. 45 (1966).
[6]
Allocating Independent Subtasks on Parallel Processors, IEEE Trans. on Soft. Eng. SE-11, 10 (Oct. 1985).
[7]
S.T. Leutenegger and M.K. Vernon. The Performance of Multiprogrammed Multiprocessor Scheduling Policies, Proc. 1990 ACM SIGMETRICS Conf. on Meas. and Mod. of Comp. Sys. (May 1990).
[8]
T. Lovett and S. Thakkar. The Symmetry Multiprocessor System. Proc. 1988 Intl. Conf. on Par. Proc. (Aug. 1988).
[9]
S. Majumdar and D.L. Eager. Scheduling in Multiprogrammed Parallel Systems. Proc. 1988 ACM SIGMETRICS Conf. on Meas. and Mod. of Comp. Sys. (May 1988).
[10]
J.K. Ousterhout. Scheduling Techniques for Concurrent Systems. Proc. 3rd International Conference on Distributed Computing Systerns (October 1982), pp. 22-30.
[11]
C.D. Polychronopoulos and D.}. Kuck. Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers. IEEE Trans. on Comp. C-36,12 (December 1987), pp. 1425-1439.
[12]
M. Reiser and S.S. Lavenberg. Mean Value Analysis of Closed Multichain Queueing Networks, JACM 27, 2 (April I980).
[13]
C.H. Sauer and K.M. Chandy. The Impact of Distributions and Disciplines on Multiple Processor Systems. CACM 22, 1 (Jan. 1979), pp. 25-34.
[14]
K.C. Sevcik. Characterizations of Parallelism in Applications and Their Use in Scheduling. Proc. 1989 ACM SIGMETRICS and Per. formance '89 Intl. Conf. on Meas. and Mod. of Computer Systems (May 1989).
[15]
C.P. Thacker, L.C. Stewart, and E.H. Satterthwaite, Jr. Firefly: A Multiprocessor Workstation. IEEE Trans. on Comp. 37, 8 (Aug. 1988), pp. 909-920.
[16]
A. Tucker and A. Gupta. Process Control and Scheduling Issues for Multiprogrammed Shared-Memory Multiprocessors. Proc. 12th ACM Syrup. on Op. Sys, Princ. (Dec. 1989).
[17]
M. Young et al. The Duality of memory and Communication in the Implementation of a Multiprocessor Operating System. Proc. 11th ACM Syrup. on Op. Sys. Prin. (Nov. 1987).
[18]
J. Zahorjan, E.D. Lazowska, and D.L. Eager. Spinning Versus Blocking in Parallel Systems with Uncertainty. Proc. International Symposium on Performance of Distributed and Parallel Systems, December 1988.
[19]
J. Zahorjan, E.D. Lazowska, and D.L. Eager. The Effect of Scheduling Discipline on Spin Overhead in Shared Memory Parallel Systems. University of Washington, Tech. Rpt. 89-07-03 (July 1989).
[20]
J. Zahorjan and C. McCann. Processing Scheduling in Shared Memory Multiprocessors. University of Washington, Tech. Rpt. 89-09-17 (Sept. 1989).

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review  Volume 18, Issue 1
May 1990
269 pages
ISSN:0163-5999
DOI:10.1145/98460
Issue’s Table of Contents
  • cover image ACM Conferences
    SIGMETRICS '90: Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
    April 1990
    273 pages
    ISBN:0897913590
    DOI:10.1145/98457
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1990
Published in SIGMETRICS Volume 18, Issue 1

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)111
  • Downloads (Last 6 weeks)17
Reflects downloads up to 04 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2011)Real-time large-deformation substructuringACM Transactions on Graphics10.1145/2010324.196498630:4(1-8)Online publication date: 25-Jul-2011
  • (2011)Sensitive couture for interactive garment modeling and editingACM Transactions on Graphics10.1145/2010324.196498530:4(1-12)Online publication date: 25-Jul-2011
  • (2011)Blue-noise point sampling using kernel density modelACM Transactions on Graphics10.1145/2010324.196494330:4(1-12)Online publication date: 25-Jul-2011
  • (2010)A distributed service-oriented architecture for business process executionACM Transactions on the Web10.1145/1658373.16583754:1(1-33)Online publication date: 29-Jan-2010
  • (2010)Understanding transportation modes based on GPS data for web applicationsACM Transactions on the Web10.1145/1658373.16583744:1(1-36)Online publication date: 29-Jan-2010
  • (2005)Theory and practice in parallel job schedulingJob Scheduling Strategies for Parallel Processing10.1007/3-540-63574-2_14(1-34)Online publication date: 12-Jul-2005
  • (2005)CAPE: A Constraint-Aware Adaptive Stream Processing EngineStream Data Management10.1007/0-387-25229-0_5(83-111)Online publication date: 2005
  • (2001)Parallel Models and Job Characterization for System SchedulingComputational Science - ICCS 200110.1007/3-540-45718-6_70(648-656)Online publication date: 17-Jul-2001
  • (1997)Execution of compute-intensive applications into parallel machinesInformation Sciences: an International Journal10.1016/S0020-0255(96)00174-097:1-2(83-124)Online publication date: 1-Mar-1997
  • (1994)Analysis of Processor Allocation in Multiprogrammed, Distributed-Memory Parallel Processing SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/71.2730475:4(401-420)Online publication date: 1-Apr-1994
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media