Skip to main content
Article thumbnail
Location of Repository

An Efficient Kernel-Level Scheduling Methodology for Multiprogrammed Shared Memory Multiprocessors

By Eleftherios D. Polychronopoulos, Dimitrios S. Nikolopoulos and Xavier Martorell

Abstract

In this work we present an innovative kernel-level scheduling methodology designed for multiprogrammed shared-memory multiprocessors. We propose three scheduling policies equipped with both dynamic space sharing and time sharing, to ensure the scalability of parallel programs under multiprogramming while increasing processor utilization and overall system performance. Our scheduling methodology is designed for multidisciplinary multiprocessor schedulers that need to handle applications with widely different resource requirements and execution characteristics. We implemented the policies on a 64-processor SGI Origin2000 running Cellular IRIX and evaluated them in direct comparison with the native kernel scheduler. Our results demonstrate solid performance improvements over the vendor execution environment.

Year: 1999
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.114
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.wm.edu/~dsn/pape... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.