Communication Dans Un Congrès Année : 2026

Priority-BF: a Task Manager for Priority-Based Scheduling

Résumé

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. Our solution relies on a qualitative description of priorities and pulls from two key approaches: the Easy-BF algorithm and the Conservative Backfilling algorithms. This 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.

Fichier principal
Vignette du fichier
Paper159000197.pdf (1001.72 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-05109295 , version 1 (12-06-2025)

Licence

Identifiants

Citer

Ana Gainaru, Scott Klasky, Guillaume Pallez. Priority-BF: a Task Manager for Priority-Based Scheduling. EURO-PAR 2025 - 31st International European Conference on Parallel and Distributed Computing, Aug 2025, Dresden, Germany. pp.219-232, ⟨10.1007/978-3-031-99854-6_15⟩. ⟨hal-05109295⟩
1738 Consultations
405 Téléchargements

Altmetric

Partager

  • More