Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay

Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Algorithm Overview

13 of 17

13 of 17

Algorithm Overview

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay
  3. 3 Precedence-Constrained Scheduling on
  4. 4 Duplication A job is duplicated it is cute on multiple machines Duplication can be helpful in prence of communication delay
  5. 5 Motivation: Heterogenous Processing
  6. 6 Prior & Related Work
  7. 7 Central Question
  8. 8 Makespan Algorithm
  9. 9 Integrality Gap
  10. 10 Bounding the Duplication Advantage
  11. 11 Challenges: Delay Constraints
  12. 12 LP Relaxation
  13. 13 Algorithm Overview
  14. 14 Iterative Scheduling
  15. 15 Lower Bound
  16. 16 Main Result & Techniques
  17. 17 Open Problems

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.