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.
| Original language | English |
|---|---|
| Pages (from-to) | 1594-1600 |
| Number of pages | 7 |
| Journal | IEICE Transactions on Information and Systems |
| Volume | E86-D |
| Issue number | 9 |
| Publication status | Published - Sept 2003 |
| Externally published | Yes |