Search Results for author:
Found 4 papers, 1 papers with code
ForestColl: Efficient Collective Communications on Heterogeneous Network Fabrics
ForestColl also outperforms other state-of-the-art schedule generation techniques with both up to 61\% more efficient generated schedules and orders of magnitude faster schedule generation speed.
Bandwidth Optimal Pipeline Schedule for Collective Communication
We present a strongly polynomial-time algorithm to generate bandwidth optimal allgather/reduce-scatter on any network topology, with or without switches.
Efficient Direct-Connect Topologies for Collective Communications
Our algorithms start from small, optimal base topologies and associated communication schedules and use a set of techniques that can be iteratively applied to derive much larger topologies and schedules.
AutoLRS: Automatic Learning-Rate Schedule by Bayesian Optimization on the Fly
This mutual-training process between BO and the loss-prediction model allows us to limit the training steps invested in the BO search.
