research-article

Performance of Hierarchical Processor Scheduling in Shared-Memory Multiprocessor Systems

Authors:

Sivarama P. Dandamudi,

Samir AyachiAuthors Info & Claims

IEEE Transactions on Computers, Volume 48, Issue 11

Pages 1202 - 1213

https://doi.org/10.1109/12.811109

Published: 01 November 1999 Publication History

Abstract

Processor scheduling policies for multiprocessor systems can be broadly divided into space-sharing and time-sharing policies. Space-sharing policies divide the system processors into a number of partitions and each partition is exclusively allocated to a single job. In time-sharing policies, processors are temporally shared by jobs. Several space-sharing and time-sharing policies have been proposed for small-scale shared-memory systems and require a central run queue and/or central scheduler. The central queue/scheduler poses serious scalability problems for large-scale multiprocessor systems. Furthermore, space-sharing and time-sharing policies have their advantages and disadvantages. In this paper, we propose a new multiprocessor scheduling policy that eliminates contention for the central queue/scheduler. Our hierarchical scheduling policy (HSP) is a self-scheduling policy and uses a hierarchical run queue organization to facilitate processor allocation to jobs. We show that the HSP policy is considerably better than purely space-sharing and purely time-sharing policies over a wide range of system and workload parameters of interest.

References

[1]

J. Abawajy and S. Dandamudi, “Parallel Application Scheduling on Networks of Workstations,” technical report, School of Computer Science, Carleton Univ., Ottawa, Canada, 1998.

[2]

S.L. Au and S.P. Dandamudi, “The Impact of Program Structure on the Performance of Scheduling Policies in Multiprocessor Systems,” Int'l J. Computers and Their Applications, vol. 3, no. 1, pp. 17-30, Apr. 1996.

[3]

S. Ayachi, “A Hierarchical Processor Scheduling Policy for NUMA Systems,” master's thesis, School of Computer Science, Carleton Univ., Ottawa, Canada, 1995.

[4]

S. Chiang R.K. Mansharamani and M.K. Vernon, “Use of Application Characteristics and Limited Preemption for Run-to-Completion Parallel Processor Scheduling Policies,” Proc. ACM SIGMETRICS Conf., pp. 33-44, 1994.

Digital Library

[5]

S. Dandamudi and T.K. Thyagaraj, “A Hierarchical Scheduling Policy for Distributed-Memory Multicomputer Systems,” Proc. IEEE Int'l Conf. High Performance Computing, Bangalore, India, pp. 218-223, Dec. 1997.

Digital Library

[6]

S.P. Dandamudi and S.P. Cheng, “A Hierarchical Task Queue Organization for Shared-Memory Multiprocessor Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 1, pp. 1-16, Jan. 1995.

Digital Library

[7]

L. Dowdy, “On the Partitioning of Multiprocessor Systems,” technical report, Vanderbilt Univ., July 1988.

[8]

D.G. Feitelson and L. Rudolph, “Distributed Hierarchical Control for Parallel Processing,” Computer, vol. 23, no. 5, pp. 65-77, May 1990.

Digital Library

[9]

D.G. Feitelson and L. Rudolph, “Toward Convergence in Job Schedulers for Parallel Supercomputers,” Job Scheduling Strategies for Parallel Processing, D. Feitelson, and L. Rudolph, eds., pp. 1-26, 1996.

Digital Library

[10]

D.G. Feitelson L. Rudolph U. Schwiegelshohn K.C. Sevcik and P. Wong, “Theory and Practice in Parallel Job Scheduling,” Job Scheduling Strategies for Parallel Processing, D. Feitelson and L. Rudolph, eds., pp. 1-34, 1997.

Digital Library

[11]

D.G. Feitelson and B. Nitzberg, “Job Characteristics of a Production Parallel Scientific Workload on the NASA Ames iPSC/860,” Job Scheduling Strategies for Parallel Processing, D.G. Feitelson and L. Rudolph, eds., pp. 337-360, 1995.

Digital Library

[12]

D.G. Feitelson and L. Rudolph, “Parallel Job Scheduling: Issues and Approaches,” Job Scheduling Strategies for Parallel Processing, D. Feitelson and L. Rudolph, eds., pp. 1-18, 1995.

Digital Library

[13]

S. Hotovy, “Workload Evolution on the Cornell Theory Center IBM SP2,” Job Scheduling Strategies for Parallel Processing, D.G. Feitelson and L. Rudolph, eds., pp. 27-40, 1996.

Digital Library

[14]

J. Jann P. Pattnaik H. Wang J. Skovira and J. Riordan, “Modeling the Workload of MPPs,” Job Scheduling Strategies for Parallel Processing, D.G. Feitelson and L. Rudolph, eds., 1997.

[15]

S.T. Leutenegger and M.K. Vernon, “The Performance of Multiprogrammed Multiprocessing Scheduling Policies,” Proc. ACM SIGMETRICS Conf., pp. 226-236, May 1990.

Digital Library

[16]

S. Majumdar D.L. Eager and R.B. Bunt, “Scheduling in Multiprogrammed Parallel Systems,” Proc. ACM SIGMETRICS Conf., pp. 104-113, May 1988.

Digital Library

[17]

C. McCann R. Vaswani and J. Zahorjan, “A Dynamic Processor Allocation Policy for Multiprogrammed Shared-Memory Multiprocessors,” ACM Trans. Computer Systems, vol. 11, no. 2, pp. 146-178, May 1993.

Digital Library

[18]

J.M. Mellor-Crummey and M.L. Scott, “Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors,” ACM Trans. Computer Systems, vol. 9, no. 1, pp. 21-65, Feb. 1991.

Digital Library

[19]

J.K. Ousterhout, “Scheduling techniques for Concurrent Systems,” Proc. Third Int'l Conf. Distributed Computing Systems, pp. 22-30, Oct. 1982.

[20]

K.C. Sevcik, “Characterizations of Parallelism in Applications and Their Use in Scheduling,” Proc. ACM SIGMETRICS Conf., pp. 171-180, 1989.

Digital Library

[21]

K.C. Sevcik, “Application Scheduling and Processor Allocation in Multiprogrammed Parallel Processing Systems,” Performance Evaluation 19, pp. 107-140, 1994.

Digital Library

[22]

K.C. Sevcik and S. Zhou, “Performance Benefits and Limitations of Large NUMA Multiprocessors,” Performance Evaluation 20, pp. 185-205, 1994.

Digital Library

[23]

A. Tucker and A. Gupta, “Process Control and Scheduling Issues for Multiprogrammed Shared-Memory Multiprocessors,” Proc. ACM Symp. Operating System Principles, pp. 159-166, Dec. 1989.

Digital Library

[24]

B. Xie and S. Dandamudi, “Hierarchical Architecture for Parallel Query Processing on Networks of Workstatins,” Proc. IEEE Int'l Conf. High Performance Computing, Chennai, India, Dec. 1998.

Digital Library

[25]

J. Zahorjan and C. McCann, “Processor Scheduling in Shared Memory Multiprocessors,” Proc. ACM SIGMETRICS Conf., pp. 214-225, May 1990.

Digital Library

Cited By

Chouhan PDail HCaron EVivien F(2006)Automatic Middleware Deployment Planning On ClustersInternational Journal of High Performance Computing Applications10.1177/109434200606840420:4(517-530)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1177/1094342006068404
Tang YWang TLi X(2005)The design and implementation of LilyTask in shared memoryACM SIGOPS Operating Systems Review10.1145/1075395.107540039:3(52-63)Online publication date: 1-Jul-2005
https://dl.acm.org/doi/10.1145/1075395.1075400
Hoffmann RKorch MRauber THuskamp J(2004)Performance Evaluation of Task Pools Based on Hardware SynchronizationProceedings of the 2004 ACM/IEEE conference on Supercomputing10.1109/SC.2004.38Online publication date: 6-Nov-2004
https://dl.acm.org/doi/10.1109/SC.2004.38
Show More Cited By

Index Terms

Performance of Hierarchical Processor Scheduling in Shared-Memory Multiprocessor Systems
1. Computer systems organization
  1. Architectures
    1. Parallel architectures
      1. Multiple instruction, multiple data
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Scheduling algorithms
    2. Online algorithms
      1. Online learning algorithms
        Scheduling algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning
        Sequential decision making

Recommendations

A Hierarchical Processor Scheduling Policy for Multiprocessor Systems
SPDP '96: Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)

Processor scheduling policies can be broadly divided into space-sharing and time-sharing policies. Space-sharing policies partition system processors and each partition is allocated exclusively to a job. In time-sharing policies, processors are ...
A new fault-tolerant scheduling technique for real-time multiprocessor systems
RTCSA '95: Proceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications

In multiprocessors used for implementing real-time applications, it is strongly required to ensure that tasks' deadlines are met in spite of faults. In this paper, we discuss fault-tolerant task scheduling techniques in real-time multiprocessor systems ...
Processor Saving Scheduling Policies for Multiprocessor Systems

In this paper, processor scheduling policies that "save" processors are introduced and studied. In a multiprogrammed parallel system, a "processor saving" scheduling policy purposefully keeps some of the available processors idle in the presence of work ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computers

IEEE Transactions on Computers Volume 48, Issue 11

November 1999

144 pages

ISSN:0018-9340

Editor:
Jean-Luc Gaudiot
Univ. of Southern California, Los Angeles

Issue’s Table of Contents

Copyright © Copyright © 1999 IEEE. All Rights Reserved.

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 November 1999

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chouhan PDail HCaron EVivien F(2006)Automatic Middleware Deployment Planning On ClustersInternational Journal of High Performance Computing Applications10.1177/109434200606840420:4(517-530)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1177/1094342006068404
Tang YWang TLi X(2005)The design and implementation of LilyTask in shared memoryACM SIGOPS Operating Systems Review10.1145/1075395.107540039:3(52-63)Online publication date: 1-Jul-2005
https://dl.acm.org/doi/10.1145/1075395.1075400
Hoffmann RKorch MRauber THuskamp J(2004)Performance Evaluation of Task Pools Based on Hardware SynchronizationProceedings of the 2004 ACM/IEEE conference on Supercomputing10.1109/SC.2004.38Online publication date: 6-Nov-2004
https://dl.acm.org/doi/10.1109/SC.2004.38
Dandamudi SZhou Z(2004)Performance of adaptive space-sharing policies in dedicated heterogeneous cluster systemsFuture Generation Computer Systems10.1016/j.future.2004.02.00120:5(895-906)Online publication date: 1-Jun-2004
https://dl.acm.org/doi/10.1016/j.future.2004.02.001
Thanalapati TDandamudi S(2001)An Efficient Adaptive Scheduling Scheme for Distributed Memory MulticomputersIEEE Transactions on Parallel and Distributed Systems10.1109/71.94074912:7(758-768)Online publication date: 1-Jul-2001
https://dl.acm.org/doi/10.1109/71.940749

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents