A High-Level API for Dynamic Load Balancing in Large-Scale Parameter Sweeps
Abstract Parameter sweep studies, such as virtual drug screening, may exhibit significant load imbalance during batched execution on large-scale clusters, resulting in idle and thus wasted resources. Work stealing is a popular method for dynamic load balancing in such scenarios. However, we demonstrate that work stealing alone falls short in cases where a few ranks generate long running high-cost jobs, particularly towards the end of a computation. To address this challenge, we propose high-cost probing, a mechanism for distributing high-cost jobs across workers early during program execution by leveraging user-provided cost hints. We extend the Celerity programming model for distributed accelerator computing with a high-level API tailored to expressing parameter sweep-style workflows that may benefit from high-cost probing. We demonstrate the effectiveness of our approach on synthetic benchmarks as well as a real-world virtual screening application with a highly irregular workload, achieving a 73 percentage point reduction in load imbalance on 128 GPUs.
Authors
- Thomas Fahringer (ORCID: https://orcid.org/0000-0003-4293-1228)
- Philip Salzmann (ORCID: https://orcid.org/0000-0002-8668-4639)
- Peter Thoman (ORCID: https://orcid.org/0000-0002-4028-7451)
Institutions
- Universität Innsbruck (AT)
Publication Details
- Journal
- International Journal of Parallel Programming
- Published
- 2025-06-28
- DOI
- https://doi.org/10.1007/s10766-025-00804-4
- Primary Topic
- Distributed and Parallel Computing Systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Österreichische Forschungsförderungsgesellschaft
- Medizinische Universität Innsbruck
- Universität Innsbruck