Name
Abstract | ||
|---|---|---|
Cloud applications generate a mix of flows with and without deadlines. Scheduling such mix-flows is a key challenge; our experiments show that trivially combining existing schemes for deadline/non-deadline flows is problematic. For example, prioritizing deadline flows hurts flow completion time (FCT) for non-deadline flows, with minor improvement for deadline miss rate. We present Karuna, a first systematic solution for scheduling mix-flows. Our key insight is that deadline flows should meet their deadlines while minimally impacting the FCT of non-deadline flows. To achieve this goal, we design a novel Minimal-impact Congestion control Protocol (MCP) that handles deadline flows with as little bandwidth as possible. For non-deadline flows, we extend an existing FCT minimization scheme to schedule flows with known and unknown sizes. Karuna requires no switch modifications and is back- ward compatible with legacy TCP/IP stacks. Our testbed experiments and simulations show that Karuna effectively schedules mix-flows, for example, reducing the 95th percentile FCT of non-deadline flows by up to 47.78% at high load compared to pFabric, while maintaining low (<5.8%) deadline miss rate. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1145/2934872.2934888 | SIGCOMM |
Keywords | Field | DocType |
Datacenter network, Deadline, Flow scheduling | Scheduling (computing),Computer science,Computer network,Testbed,Bandwidth (signal processing),Schedule,Minification,Network congestion,Earliest deadline first scheduling,Distributed computing,Cloud computing | Conference |
Citations | PageRank | References |
27 | 0.82 | 18 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Li Chen | 1 | 158 | 11.63 |
| Kai Chen | 2 | 744 | 59.02 |
| Wei Bai 0001 | 3 | 190 | 13.46 |
| Mohammad Alizadeh | 4 | 1482 | 77.16 |