@inbook{5214beba1fcd468aa33a694ecf1a1668,
title = "Backfilling with lookahead to optimize the performance of parallel job scheduling",
abstract = "The utilization of parallel computers depends on how jobs are packed together: if the jobs are not packed tightly, resources are lost due to fragmentation. The problem is that the goal of high utilization may conflict with goals of fairness or even progress for all jobs. The common solution is to use backfilling, which combines a reservation for the first job in the interest of progress with packing of later jobs to fill in holes and increase utilization. However, backfilling considers the queued jobs one at a time, and thus might miss better packing opportunities. We propose the use of dynamic programming to find the best packing possible given the current composition of the queue. Simulation results show that this indeed improves utilization, and thereby reduces the average response time and average slowdown of all jobs.",
author = "Edi Shmueli and Feitelson, {Dror G.}",
year = "2003",
doi = "10.1007/10968987_12",
language = "אנגלית",
isbn = "9783540397274",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "228--251",
editor = "Dror Feitelson and Larry Rudolph and Uwe Schwiegelshohn",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "גרמניה",
}