Backfilling strategies for scheduling streams of jobs on computational farms

This paper presents a set of strategies for scheduling a stream of batch jobs on the machines of a heterogeneous computational farm. Our proposal is based on a flexible backfilling, which schedules jobs according to a priority assigned to each jobs submitted for the execution. Priority values are computed as a result of a set of heuristics whose main goal is both to improve resources utilization and to meet the QoS requirements of the jobs. The heuristics consider the deadlines of the jobs, their estimated execution time and aging in the scheduling queue. Furthermore, the set of software licenses required by a job is also considered. The different proposals have been compared through simulations. Performance figures show the applicability of our approach.