This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Performance of Hierarchical Processor Scheduling in Shared-Memory Multiprocessor Systems
November 1999 (vol. 48 no. 11)
pp. 1202-1213

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.

[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.-H. Chiang, R.K. Mansharamani, and M.K. Vernon, "Use of Application Characteristics and Limited Preemption for Run-to-Completion Parallel Processor Scheduling Policies," ACM SIGMETRICS, pp. 33-44, 1994.
[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.
[6] S. Dandamudi and 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.
[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.
[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.
[10] D.G. Feitelson, L. Rudolph, U. Schwiegelshohn, K.C. Sevcik, and P. Wong, “Theory and Practice in Parallel Job Scheduling,” Proc. Int'l Parallel and Distributed Processing Symp. Workshop Job Scheduling Strategies for Parallel Processing, pp. 1-34, Apr. 1997.
[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, Springer-Verlag, 1995.
[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.
[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, Springer-Verlag, 1996.
[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 multiprocessor scheduling policies,”inProc. ACM Sigmetrics Conf., Boulder, CO, 1990, pp. 226–236.
[16] S. Majumdar, D. L. Eager, and R. B. Bunt,“Scheduling in multiprogrammed parallel systems,”inProc. ACM Sigmetrics Conf., Santa Fe, NM, 1988, pp. 104–113.
[17] C. McCann,R. Baswami,, and J. Zahoran,“A dynamic processor allocation policy for multiprogrammed shared-memorymultiprocessors,” ACM Trans. Computer Systems, vol. 11, no. 2, pp. 146-176, 1993.
[18] J. M. Mellor-Crummey and M. L. Scott,“Algorithms for scalable synchronization on shared-memory multiprocessors,”ACM Trans. Comput. Syst., vol, 9, no. 1, pp. 21–65, Feb. 1991.
[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,”inProc. ACM Sigmetrics Conf., Berkeley, 1989, pp. 171–180.
[21] K.C. Sevcik, “Application Scheduling and Processor Allocation in Multiprogrammed Parallel Processing Systems,” Performance Evaluation–An Int'l J., vol. 19, nos. 2-3, pp. 107–140, Mar. 1994.
[22] K.C. Sevcik and S. Zhou, “Performance Benefits and Limitations of Large NUMA Multiprocessors,” Performance Evaluation 20, pp. 185-205, 1994.
[23] A. Tucker and A. Gupta, “Process Control and Scheduling Issues on a Network of Multiprocessors,” Proc. 12th ACM Symp. Operating System Principles, pp. 159–166, Dec. 1989.
[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.
[25] J. Zahorjan and C. McCann,“Processor scheduling in shared memory multiprocessors,”inProc. 1990 ACM SIGM Conf. Meas., Model., Comput., Syst., May 1990, pp. 214–225.

Index Terms:
Hierarchical scheduling, multiprocessor systems, performance evaluation, processor scheduling, space-sharing, time-sharing.
Citation:
Sivarama P. Dandamudi, Samir Ayachi, "Performance of Hierarchical Processor Scheduling in Shared-Memory Multiprocessor Systems," IEEE Transactions on Computers, vol. 48, no. 11, pp. 1202-1213, Nov. 1999, doi:10.1109/12.811109
Usage of this product signifies your acceptance of the Terms of Use.