skip to main content


1 results for: All records
Author ORCID ID is 0000000227890846
Full Text and Citations
  1. Max-min fairness is often used in the performance modeling of interconnection networks. Existing methods to compute max-min fair rates for multi-commodity flows have high complexity and are computationally infeasible for large networks. In this paper, we show that by considering topological features, this problem can be solved efficiently for the fat-tree topology that is widely used in data centers and high performance compute clusters. Several efficient new algorithms are developed for this problem, including a parallel algorithm that can take advantage of multi-core and shared-memory architectures. Using these algorithms, we demonstrate that it is possible to find the max-min fairmore » rate allocation for multi-commodity flows in fat-tree networks that support tens of thousands of nodes. We evaluate the run-time performance of the proposed algorithms and show improvement in orders of magnitude over the previously best known method. Finally, we further demonstrate a new application of max-min fair rate allocation that is only computationally feasible using our new algorithms.« less

"Cited by" information provided by Web of Science.

DOE PAGES offers free public access to the best available full-text version of DOE-affiliated accepted manuscripts or articles after an administrative interval of 12 months. The portal and search engine employ a hybrid model of both centralized and distributed content, with PAGES maintaining a permanent archive of all full text and metadata.