Skip to main content
Article thumbnail
Location of Repository

Concerning the Length of Time Slots for Efficient Gang Scheduling

By B. B. Zhou, A. M. Goscinski and R. P. Brent

Abstract

Applying gang scheduling can alleviate the blockade problem caused by exclusively used space-sharing strategies for parallel processing. However, the original form of gang scheduling is not practical as there are several fundamental problems associated with it. Recently many researchers have developed new strategies to alleviate some of these problems. Unfortunately, one important problem has not been so far seriously addressed, that is, how to set the length of time slots to obtain a good performance of gang scheduling. In this paper we present a strategy to deal with this important issue for efficient gang scheduling

Year: 2003
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.8598
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://wwwmaths.anu.edu.au/~br... (external link)
  • Suggested articles


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