YoVDO

Polylogarithmic Guarantees for Generalized Reordering Buffer Management

Offered By: IEEE via YouTube

Tags

IEEE FOCS: Foundations of Computer Science Courses Advanced Algorithms Courses

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

Advanced Algorithms and Complexity
University of California, San Diego via Coursera
NP-Complete Problems
University of California, San Diego via edX
Efficient Zero Knowledge Proof from Interactive Proofs
Simons Institute via YouTube
Dynamic Algorithms for LIS and Distance to Monotonicity
Association for Computing Machinery (ACM) via YouTube
Near-Optimal Decremental SSSP in Dense Weighted Digraphs
IEEE via YouTube