Backfilling with lookahead to optimize the packing of parallel jobs

DOI10.1016/J.JPDC.2005.05.003zbMath1077.68950OpenAlexW2034091599MaRDI QIDQ2565707

Edi Shmueli, Dror G. Feitelson

Publication date: 28 September 2005

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2005.05.003

zbMATH Keywords

lookahead optimizing scheduler

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (3)

Machine learning-based online scheduling in distributed computing ⋮ Detection workload in a dynamic grid-based intrusion detection environment ⋮ SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS

This page was built for publication: Backfilling with lookahead to optimize the packing of parallel jobs