Overview
Syllabus
Intro
Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay
Precedence-Constrained Scheduling on
Duplication A job is duplicated it is cute on multiple machines Duplication can be helpful in prence of communication delay
Motivation: Heterogenous Processing
Prior & Related Work
Central Question
Makespan Algorithm
Integrality Gap
Bounding the Duplication Advantage
Challenges: Delay Constraints
LP Relaxation
Algorithm Overview
Iterative Scheduling
Lower Bound
Main Result & Techniques
Open Problems
Taught by
IEEE FOCS: Foundations of Computer Science