The increasing demand for computational resources, particularly in High-Performance Computing environments, necessitates to rethink how we handle job scheduling strategies. This work addresses the challenge of managing concurrent jobs with differing priorities on overloaded parallel systems, where strict QoS constraints are often difficult for users to define.

This talk presents our solution to priority based scheudling relying on a qualitative description of priorities and pulls from two key approaches: the EASY-BF algorithm and the CONSERVATIVE Backfilling algorithms. Our solution improves the response time for high-priority jobs by 50% without affecting the overall system utilization. We show its applicability in several critical scenarios such as High-Performance Computing (HPC) resource management and in-situ computing.

Link to my talk: PDF

The paper assiciated to this talk:
Priority-BF: a Task Manager for Priority-Based Scheduling
Ana Gainaru, Scott Klasky, Guillaume Pallez
EURO-PAR 2025-31st International European Conference on Parallel and Distributed Computing, 2025 </br> DOI: https://doi.org/10.1007/978-3-031-99854-6_15