Go backward to Static Scheduling Go up to Top Go forward to Optimal Schedules

Deterministic Models

• Parallel algorithm:
  • Collection of tasks.
  • Some tasks must be completed before others can begin.
  • Task execution times and precedence relations are fixed and known.
• Task graph:
  • Idealized representation of algorithm execution.
  • See Quinn, Figure 5-15.
• Schedule:
  • Allocation of tasks to processors.
• Gantt chart:
  • Illustration of task schedule.
  • Visualization of processor utilization.
  • See Quinn, Figure 5-16.