You are not logged in.

Gang scheduling with a queue for large jobs

Zhou, Bing Bing and Brent, Richard 2001, Gang scheduling with a queue for large jobs, in IPDPS 2001 : 15th International Parallel and Distributed Processing Symposium : Proceedings, IEEE Computer Society, Los Alamitos, Calif., pp. 58-65.

Attached Files
Name Description MIMEType Size Downloads

Title Gang scheduling with a queue for large jobs
Author(s) Zhou, Bing Bing
Brent, Richard
Conference name International Parallel and Distributed Processing. Symposium (15th : 2001 : San Francisco, Calif.)
Conference location San Francisco, Calif.
Conference dates 23-27 Apr. 2001
Title of proceedings IPDPS 2001 : 15th International Parallel and Distributed Processing Symposium : Proceedings
Editor(s) Werner, Bob
Publication date 2001
Conference series International Parallel and Distributed Processing Symposium
Start page 58
End page 65
Publisher IEEE Computer Society
Place of publication Los Alamitos, Calif.
Summary Applying gang scheduling can alleviate the blockade problem caused by exclusively space-sharing scheduling. To simply allow jobs to run simultaneously on the same processors as in conventional gang scheduling, however, may introduce a large number of time slots in the system. In consequence the cost of context switches will be greatly increased, and each running job can only obtain a small portion of resources including memory space and processor utilisation and so no jobs can finish their computations quickly. Therefore, the number of jobs allowed to run in the system should be limited. In this paper we present some experimental results to show that by limiting real large jobs time-sharing the same processors and applying the backfilling technique we can greatly reduce the average number of time slots in the system and significantly improve the performance of both small and large jobs.
ISBN 0769509908
9780769509907
Language eng
Field of Research 080307 Operating Systems
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category E1 Full written paper - refereed
Copyright notice ©2001, IEEE Computer Society
Persistent URL http://hdl.handle.net/10536/DRO/DU:30004543

Document type: Conference Paper
Collection: School of Information Technology
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 0 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 291 Abstract Views, 0 File Downloads  -  Detailed Statistics
Created: Mon, 07 Jul 2008, 09:38:29 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.