Name
Title | ||
|---|---|---|
Using the Macroflow Abstraction to Minimize Machine Slot-time Spent on Networking in Hadoop. |
Abstract | ||
|---|---|---|
Machine slot-time spent on data transmission has direct impact on average job completion time (JCT). In this paper, we propose Macroflow, a networking abstraction that can capture the primitive scheduling granularity of machine slot-time. We demonstrate that minimizing machine slot-time is equivalent to minimizing the average macroflow completion time (MCT). We prove that minimizing MCT to be strongly NP-hard and focus on developing effective heuristics. We propose the Smallest-Macroflow-First (SMF) and Smallest-Average-Macroflow-First (SAMF) heuristics that greedily schedule macroflows based on their network footprint. To work with existing commodity switches, priority discretization is performed to classify macroflows into a small number of priority queues.
|
Year | Venue | DocType |
|---|---|---|
2018 | APNet | Conference |
ISBN | Citations | PageRank |
978-1-4503-6395-2 | 0 | 0.34 |
References | Authors | |
11 | 10 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bingchuan Tian | 1 | 12 | 4.22 |
| Chen Tian | 2 | 37 | 8.36 |
| Jiajun Sun | 3 | 1 | 2.06 |
| Junhua Yan | 4 | 0 | 0.34 |
| Yizhou Tang | 5 | 5 | 1.15 |
| Wei Wang | 6 | 1458 | 82.69 |
| Dai Haipeng | 7 | 419 | 55.44 |
| Nai Xia | 8 | 5 | 1.14 |
| guihai chen | 9 | 3537 | 317.28 |
| Wanchun Dou | 10 | 878 | 96.01 |