Polylogarithmic Guarantees for Generalized Reordering Buffer Management
Offered By: IEEE via YouTube
Course Description
Overview
Explore a comprehensive analysis of the Generalized Reordering Buffer Management problem in this 18-minute IEEE conference talk. Delve into the intricacies of polylogarithmic guarantees, examining special cases, previous work, and applications in scheduling block devices. Learn about the Block Devices LP and buffer management via block operations. Gain insights into the cost control procedure and understand the complications that arise with servers. Conclude by considering open questions in this field, presented by experts Matthias Englert, Harald Räcke, and Richard Stotz.
Syllabus
Polylogarithmic Guarantees for Generalized Reordering Butter Management
The Problem
Special Cases
Previous Work
Scheduling Block Devices
The Block Devices LP
Buffer Management via Block Operations
Overview
The Cost Control Procedure
Complications with Servers
Open Question
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against NatureIEEE via YouTube Computation in the Brain Tutorial - Part 2
IEEE via YouTube Computation in the Brain - Part 1
IEEE via YouTube Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube