2 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.NI2023★ 1 cited
Solving Max-Min Fair Resource Allocations Quickly on Large Graphs
Pooria Namyar, Behnaz Arzani, Srikanth Kandula +5
We consider the max-min fair resource allocation problem. The best-known solutions use either a sequence of optimizations or waterfilling, which only applies to a narrow set of cas…
cs.NI2023★ 2 cited
Rethinking Machine Learning Collective Communication as a Multi-Commodity Flow Problem
Behnaz Arzani, Siva Kesava Reddy Kakarla, Miguel Castro +3
We show communication schedulers' recent work proposed for ML collectives does not scale to the increasing problem sizes that arise from training larger models. These works also of…