FedQueue predicts per-facility queue delays, applies cutoff admission to bound staleness, and uses staleness-aware aggregation, yielding O(1/sqrt(R)) convergence for non-convex objectives and up to 60% faster time-to-target-accuracy in simulations and 20.5% real-world improvement.
Workshop on Job Scheduling Strategies for Parallel Processing , pages=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
FedQueue: Queue-Aware Federated Learning for Cross-Facility HPC Training
FedQueue predicts per-facility queue delays, applies cutoff admission to bound staleness, and uses staleness-aware aggregation, yielding O(1/sqrt(R)) convergence for non-convex objectives and up to 60% faster time-to-target-accuracy in simulations and 20.5% real-world improvement.