Sparse Allreduce: Efficient Scalable Communication for Power-Law Data
This work addresses a bottleneck in distributed algorithms for large-scale datasets with power-law statistics, such as web graphs and social networks, by enhancing scalability and efficiency.
The paper tackles the communication inefficiency of Allreduce operations on power-law data by proposing a hybrid approach with nested stages and a heterogeneous-degree butterfly network, achieving significant improvements over existing systems like PowerGraph and Hadoop.
Many large datasets exhibit power-law statistics: The web graph, social networks, text data, click through data etc. Their adjacency graphs are termed natural graphs, and are known to be difficult to partition. As a consequence most distributed algorithms on these graphs are communication intensive. Many algorithms on natural graphs involve an Allreduce: a sum or average of partitioned data which is then shared back to the cluster nodes. Examples include PageRank, spectral partitioning, and many machine learning algorithms including regression, factor (topic) models, and clustering. In this paper we describe an efficient and scalable Allreduce primitive for power-law data. We point out scaling problems with existing butterfly and round-robin networks for Sparse Allreduce, and show that a hybrid approach improves on both. Furthermore, we show that Sparse Allreduce stages should be nested instead of cascaded (as in the dense case). And that the optimum throughput Allreduce network should be a butterfly of heterogeneous degree where degree decreases with depth into the network. Finally, a simple replication scheme is introduced to deal with node failures. We present experiments showing significant improvements over existing systems such as PowerGraph and Hadoop.