Name
Title | ||
|---|---|---|
Joint optimization of tasks placement and routing to minimize Coflow Completion Time. |
Abstract | ||
|---|---|---|
Coflow is defined as the parrellel flows between two successive computation stages of data-parallel jobs. Reducing Coflow Completion Time (CCT) is important to improve the performance of data-parallel applications in geo-distributed datacenter networks. CCT is influenced by two factors: tasks placement and coflow routing. Previous works that optimize only one factor are insufficient in reducing CCT. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.jnca.2019.02.031 | Journal of Network and Computer Applications |
Keywords | Field | DocType |
Data-parallel job,Coflow Completion Time,Task placement,Routing inter-DC WAN,Approximation algorithm | Integer,Mathematical optimization,Scheduling (computing),Computer science,Computation,Distributed computing | Journal |
Volume | ISSN | Citations |
135 | 1084-8045 | 2 |
PageRank | References | Authors |
0.38 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yingya Guo | 1 | 49 | 5.72 |
| xie | 2 | 106 | 36.98 |
| Han Zhang | 3 | 123 | 28.55 |
| Xia Yin | 4 | 320 | 44.72 |
| Xingang Shi | 5 | 166 | 22.66 |
| Jianping Wu | 6 | 743 | 121.01 |