Claims a 1.5-approximation algorithm for makespan-minimizing coflow scheduling in heterogeneous parallel networks, but the proof relies on a schedule order that the stated algorithms never implement.
Spark: Cluster com- puting with working sets
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks
Claims a 1.5-approximation algorithm for makespan-minimizing coflow scheduling in heterogeneous parallel networks, but the proof relies on a schedule order that the stated algorithms never implement.