Asymptotically Optimal Approximation Algorithms for Coflow Scheduling

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 45-54, 2017.

Cited by: 10|Bibtex|Views27|DOI:https://doi.org/10.1145/3087556.3087567
EI
Other Links: dblp.uni-trier.de|dl.acm.org|academic.microsoft.com|arxiv.org

Abstract:

Many modern datacenter applications involve large-scale computations composed of multiple data flows that need to be completed over a shared set of distributed resources. Such a computation completes when all of its flows complete. A useful abstraction for modeling such scenarios is a coflow, which is a collection of flows (e.g., tasks, p...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments