Canary: Congestion-aware in-network allreduce using dynamic trees
Abstract
The allreduce operation is an essential building block for many distributed applications, ranging from the training of deep learning models to scientific computing. In an allreduce operation, data from multiple hosts is aggregated together and then broadcasted to each host participating in the operation. Allreduce performance can be improved by a factor of two by aggregating the data directly in the network. Switches aggregate data coming from multiple ports before forwarding the partially aggregated result to the next hop. In all existing solutions, each switch needs to know the ports from which it will receive the data to aggregate. However, this forces packets to traverse a predefined set of switches, making these solutions prone to congestion. For this reason, we design CANARY, the first congestion-aware in-network allreduce algorithm. CANARY uses load balancing algorithms to forward packets on the least congested paths. Because switches do not know from which ports they will receive the data to aggregate, they use timeouts to aggregate the data in a best-effort way. We develop a P4 CANARY prototype and evaluate it on a Tofino switch. We then validate CANARY through simulations on large networks, showing performance improvements up to 40% compared to the state-of-the-art.
People
BibTex
@ARTICLE{sensi2023canary,
abbrev_source_title = {Future gener. comput. syst.},
copyright = {Creative Commons Attribution 4.0 International},
doi = {10.3929/ethz-b-000640137},
year = {2024-03},
volume = {152},
type = {Journal Article},
institution = {EC and ETHZ},
journal = {Future Generation Computer Systems},
author = {De Sensi, Daniele and Costa Molero, Edgar and Di Girolamo, Salvatore and Vanbever, Laurent and Hoefler, Torsten},
abstract = {The allreduce operation is an essential building block for many distributed applications, ranging from the training of deep learning models to scientific computing. In an allreduce operation, data from multiple hosts is aggregated together and then broadcasted to each host participating in the operation. Allreduce performance can be improved by a factor of two by aggregating the data directly in the network. Switches aggregate data coming from multiple ports before forwarding the partially aggregated result to the next hop. In all existing solutions, each switch needs to know the ports from which it will receive the data to aggregate. However, this forces packets to traverse a predefined set of switches, making these solutions prone to congestion. For this reason, we design CANARY, the first congestion-aware in-network allreduce algorithm. CANARY uses load balancing algorithms to forward packets on the least congested paths. Because switches do not know from which ports they will receive the data to aggregate, they use timeouts to aggregate the data in a best-effort way. We develop a P4 CANARY prototype and evaluate it on a Tofino switch. We then validate CANARY through simulations on large networks, showing performance improvements up to 40% compared to the state-of-the-art.},
issn = {0167-739X},
keywords = {In-network compute; Allreduce; Load balancing},
language = {en},
publisher = {Elsevier},
title = {Canary: Congestion-aware in-network allreduce using dynamic trees},
PAGES = {70 - 82}
}Research Collection: 20.500.11850/640137