Finishing Flows Quickly with Preemptive Scheduling

@inproceedings{Hong2012FinishingFQ,
  title={Finishing Flows Quickly with Preemptive Scheduling},
  author={Chi-Yao Hong and Matthew Caesar and Brighten Godfrey},
  booktitle={SIGCOMM},
  year={2012}
}
Today's data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from optimal for satisfying latency requirements. We propose Preemptive Distributed Quick (PDQ) flow scheduling, a protocol designed to complete flows quickly and meet flow deadlines. PDQ enables flow preemption to approximate a range of scheduling disciplines. For example, PDQ can emulate a shortest job first algorithm to… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 347 citations. REVIEW CITATIONS