Engineering Commons^™

Preemptive Efficient Queueing For Scheduling Deadline-Bound Data Center Flows, Vinaykrishna Gopalakrishna

Theses

This thesis introduces a new deadline aware flow scheduling scheme called Preemptive Efficient Queuing (PEQ). Unlike other schemes which use policies like EDF, SJF or fair share, this scheme aims to procrastinate flows as much as they can afford to, while keeping with their deadlines. Thereby, PEQ prioritizes more urgent flows that have shorter time to procrastinate, or cushion time. Results of PEQ are compared with state-of-the-art schemes for the transport of data-center flows, such as Preemptive Distributed Quick (PDQ) and Deadline-Driven Delivery (D³). The results show that PEQ outperforms D³ and PDQ. We identify results …