Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Near Optimal Coflow Scheduling in Networks   The coflow scheduling problem has emerged as a popular abstraction in the
last few years to study data communication problems within a data center. In
this basic framework, each coflow has a set of communication demands and the
goal is to schedule many coflows in a manner that minimizes the total weighted
completion time. A coflow is said to complete when all its communication needs
are met. This problem has been extremely well studied for the case of complete
bipartite graphs that model a data center with full bisection bandwidth and
several approximation algorithms and effective heuristics have been proposed
recently.
  In this work, we study a slightly different model of coflow scheduling in
general graphs (to capture traffic between data centers) and develop practical
and efficient approximation algorithms for it. Our main result is a randomized
2 approximation algorithm for the single path and free path model,
significantly improving prior work. In addition, we demonstrate via extensive
experiments that the algorithm is practical, easy to implement and performs
well in practice.

15
The categories of this paper are: nucl-ex
25
The categories of this paper are: patt-sol
37
The categories of this paper are: supr-con
8
The categories of this paper are: hep-ex
27
The categories of this paper are: comp-gas
4
The categories of this paper are: cond-mat
2
The categories of this paper are: math
23
The categories of this paper are: solv-int
20
The categories of this paper are: acc-phys
29
The categories of this paper are: funct-an
13
The categories of this paper are: quant-ph
24
The categories of this paper are: dg-ga
7
The categories of this paper are: hep-th
5
The categories of this paper are: gr-qc
32
The categories of this paper are: atom-ph
35
The categories of this paper are: mtrl-th