Journal of Electrical Engineering and information Science

대한전기학회 (The Korean Institute of Electrical Engineers)
권호 표지

Two-Level Multi-Scan Scheduler Using Resource Partition Strategy by Loose Processor-Affinity

  • Sohn, Jong-Moon (Department of Computer Engineering, Pusan National University) ;
  • Kim, Gil-Yong (Department of Computer Engineering, Pusan National University)
  • 발행 : 1997.06.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

The performance of a shared memory multiprocessor system is very sensitive to process scheduling. w can enhance the performance of a whole system as well as of an individual process by taking the multiprocessor characteristics into account in the design of the process scheduler. In this paper, we proposed a general purpose scheduler for a shared memory multiprocessor, called the Two-Level Multi-Scan (TLMS) process scheduler, that considers the processor affinity loosely and decreases the interference among multiple processors greatly. The TLMS scheduler is composed of a local scheduler at each processor and a semi-global scheduler that balances the load among processors. In particular, the semi-global scheduler tries to minimize priority inversion, which is an important factor of the system performance. The TLMS scheduler also tries to reduce the number of resources to be shared and improves the processor utilization. to meet these requirements, th semi-global scheduler interacts with the operation of the local scheduler when a need arises, thus the name is loose processor-affinity. We also show that the proposed scheduling technique can be extended for other types of resources making it a general purpose resource management queue.

키워드

참고문헌

  1. The University of Rochester, Technical Report 385 Multiprogramming on Multiprocessors Mark Crovella;Prakash Das;Czarek Dubnicki;Tomas LeBlanc;Evangelos Markatos
  2. Journal of The Korea Information Science Society v.20 no.10 Bottleneck Analysis of a Multiprocessor UNIX Kernel Sang Lyul Min;Gil Yong Kim
  3. Ph.D. thesis, University of Wisconsin, Technical Report 954 Issues in multiprogrammed multiprocessor scheduling S.Leutenegger
  4. Technical Report 90-10-04, University of Washington Issus in Shared-Memory Multiprocessor Scheduling : A Performance Evaluation M.S.Squillante
  5. Proceedings of the 1991 ACM SIGMETRICS Conference on Measurements and Modeling of Computer Systems The Impact of Operating System Scheduling Policies and Synchronization Methods o the Performance of Parallel Applications A.Gupta;A.Tucker;S.Urushibara
  6. Proceedings of 1987 International Conference on Parallel Processing Process Control and Scheduling Issues for Multiprogrammed Shared-Memory Multiprocessor A.Tucker;A.Gupta
  7. Proceedings of Winter 1991 USENIX Conf. 1992 Issues in Implementation of Cache-Affinity Scheduling M.Devarakonda;A.Mukherjee
  8. Journal of Parallel and Distributed Computing v.16 no.4 Gang Scheduling Performance benefits for Fine-Grain Synchronization Dror G. Feitelson;Larry Rudolph
  9. Proceedings of 35th IEEE Comp. Soc. Intl. Conf.- COMPON 90 Design of Scalable Shared-Memory Multiprocessors: The DSH Approach D.Lenoski;K.Gharachorloo;J.Laudon;A.Gupta;J.Hennessy;M.Horowitz;M.Lam
  10. Proceedings of Summer 1990 USENIX Conference The Performance Measurement of a Multiprocessor Sprite Kernel J.H.Hartman;J.K.Ousterhaut
  11. Proceedings of 1990 ACM SIGMETRICS Conference on Mesurements and Modelling of Computer Systems Processor Scheduling in Shared Memory Multiprocessors J.Zahorjan;C.McCann
  12. Proceedings of the Winter 1993 USENIX Conference Efficient Kernel Memory Allocation on Shaed-Memory Multiprocessors Paul E. McKenney;Jack Slingwine
  13. Stanford University, CSL-TR-96-688 OS Support for Improving Data Locality on CC-NUMA Compute Servers Ben Verghese;Scott Devine;Anoop Gupta;Mendel Rosenblum