Abstract:
In this paper, we propose CGM-PS, a partial-decentralized, un-starving, work-conservative, and preemptive coflow scheduling scheme to shorten the Coflow Completion Time (...Show MoreMetadata
Abstract:
In this paper, we propose CGM-PS, a partial-decentralized, un-starving, work-conservative, and preemptive coflow scheduling scheme to shorten the Coflow Completion Time (CCT) for TCP flows in data center networks (DCNs). In CGMPS, we propose both inter- and intra- coflow scheduling policies. In inter-coflow scheduling, we present P-SEBF, which adopts a connected-graph model based novel concept Partialcoflow, to achieve approximate SEBF scheduling in a partial-decentralized manner. In intra-coflow scheduling, we present FP-MDFS to give flow-level priorities and appropriate rates to TCP flows for finishing the coflows as quick as possible without wasting network capacities in a decentralized manner. Trace-based simulation results show that, among existing coflow scheduling schemes, CGM-PS can achieve the minimal CCTs both on average and in the 90th percentile. In brief, CGM-PS only brings about similar scheduling overhead with the decentralized schemes, while it can achieve the CCT performance even better than the near optimal centralized scheme.
Date of Conference: 26-29 October 2015
Date Added to IEEE Xplore: 07 January 2016
ISBN Information: