Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Computer Engineering
Preemptive Efficient Queueing For Scheduling Deadline-Bound Data Center Flows, Vinaykrishna Gopalakrishna
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 (D3). The results show that PEQ outperforms D3 and PDQ. We identify results …
Source-Channel Coding For Coordination Over A Noisy Two-Node Network, Sarah A. Obead
Source-Channel Coding For Coordination Over A Noisy Two-Node Network, Sarah A. Obead
Theses
Recently, the concept of coordinating actions between distributed agents has emerged in the information theory literature. It was first introduced by Cuff in 2008 for the point-to-point case of coordination. However, Cuff’s work and the vast majority of the follow-up research are based on establishing coordination over noise-free communication links. In contrast, this thesis investigates the open problem of coordination over noisy point-to-point links. The aim of this study is to examine Shannon’s source-channel separation theorem in the context of coordination. To that end, a general joint scheme to achieve the strong notion of coordination over a discrete memoryless channel …