DocumentCode
2365029
Title
Self-adapting backfilling scheduling for parallel systems
Author
Lawson, Barry G. ; Smirni, Evgenia ; Puiu, Daniela
Author_Institution
Dept. of Math. & Comput. Sci., Richmond Univ., VA, USA
fYear
2002
fDate
2002
Firstpage
583
Lastpage
592
Abstract
We focus on non-FCFS job scheduling policies for parallel systems that allow jobs to backfill, i.e., to move ahead in the queue, given that they do not delay certain previously submitted jobs. Consistent with commercial schedulers that maintain multiple queues where jobs are assigned according to the user-estimated duration, we propose a self-adapting backfilling policy that maintains multiple job queues to separate short from long jobs. The proposed policy adjusts its configuration parameters by continuously monitoring the system and quickly reacting to sudden fluctuations in the workload arrival pattern and/or severe changes in resource demands. Detailed performance comparisons via simulation using actual supercomputing, traces from the parallel workload archive indicate that the proposed policy consistently outperforms traditional backfilling.
Keywords
parallel machines; parallel processing; processor scheduling; queueing theory; resource allocation; software performance evaluation; backfilling; batch schedulers; job scheduling; parallel systems; performance evaluation; resource demands; workload arrival; Computer science; Condition monitoring; Delay; Educational institutions; Fluctuations; Mathematics; Parallel processing; Performance analysis; Processor scheduling; Resource management;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing, 2002. Proceedings. International Conference on
ISSN
0190-3918
Print_ISBN
0-7695-1677-7
Type
conf
DOI
10.1109/ICPP.2002.1040916
Filename
1040916
Link To Document