关键词: 并行作业调度, FCFS, 作业可塑性, 遗传算法

Abstract: One of the most popular scheduling algorithms is FCFS（First-Come-First-Served） combined with backfilling in the batch system for supercomputer，but it has some insufficiencies in the turnaround time and the utilization because of lacking flexibility.In this paper，presents a DGA（Dynamic Genetic Algorithm） method which dynamically decides resource allocation based on moldability of the parallel jobs.When determining a processor number for a job，DGA attempts to balance this job with all other jobs in the waiting queue by predicting the mean turnaround time and to choose an optimized processor number by genetic algorithm.The experiment results on the simulator with the realistic workload show that DGA method both outperforms the conventional backfilled FCFS strategies such as EASY approach and outperforms other moldable job scheduling strategies such as Cirne-Berman approach.

Key words: parallel job scheduling, First-Come-First-Served（FCFS）, moldability, genetic algorithm