IEICE TRANSACTIONS on Information
Concerning the Length of Time Slots for Efficient Gang Scheduling
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E86-D No.9 pp.1594-1600
- Publication Date
- 2003/09/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section INVITED PAPER (Special Issue on Parallel and Distributed Computing, Applications and Technologies)
- Category
- Algorithms and Applications
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Bing Bing ZHOU, Andrzej M. GOSCINSKI, Richard P. BRENT, "Concerning the Length of Time Slots for Efficient Gang Scheduling" in IEICE TRANSACTIONS on Information,
vol. E86-D, no. 9, pp. 1594-1600, September 2003, doi: .
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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e86-d_9_1594/_p
Copy
@ARTICLE{e86-d_9_1594,
author={Bing Bing ZHOU, Andrzej M. GOSCINSKI, Richard P. BRENT, },
journal={IEICE TRANSACTIONS on Information},
title={Concerning the Length of Time Slots for Efficient Gang Scheduling},
year={2003},
volume={E86-D},
number={9},
pages={1594-1600},
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.},
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - Concerning the Length of Time Slots for Efficient Gang Scheduling
T2 - IEICE TRANSACTIONS on Information
SP - 1594
EP - 1600
AU - Bing Bing ZHOU
AU - Andrzej M. GOSCINSKI
AU - Richard P. BRENT
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E86-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 2003
AB - 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.
ER -
English
