Loading Web-Font TeX/Main/Regular

2.6 Directed Acyclic Graphs (DAGs) & Scheduling

Processor Time Bounds


Give the correct bound! Here we're concerned with the general problem of parallel task scheduling, but we stick to the language of our running example of class scheduling.

  1. Number of semesters in a shortest possible schedule, with no limit on classes per term =

    Exercise 1

  2. Maximum classes per term needed to achieve shortest schedule \leq

    Exercise 2

  3. Maximum classes per term needed to achieve shortest schedule \geq

    Exercise 3

  4. Max chain size \geq

    Exercise 4