Lecture: Parallel Algorithms - Scheduling

Overview

The course gives an introduction into the basics of scheduling theory, but will also highlight practical aspects when solving scheduling problems. The course introduces basic concepts and notation used in scheduling research. Then, selected topics are discussed in more detail, such as: shop scheduling, scheduling with parallel tasks, online scheduling, approximation algorithms in scheduling, divisible load scheduling, simulation and scheduling.

Information

Exercises and exam

If possible, there will be oral exams in the last week of the semester.

Material / Slides

All slides will be made available for download on TUWEL.

Lectures will be provided online.

Lectures

  1. Wednesday, 07.10.2020: Lecture 0, Preliminaries via Zoom (14:00 - 15:00)
  2. Wednesday, 14.10.2020: Lecture 1 (pre-recorded)
  3. Wednesday, 21.10.2020: Lecture 2 (pre-recorded)
  4. Wednesday, 28.10.2020: Lecture 3 (pre-recorded), Zoom Meeting 14:00-16:00 (Assignment 1)
  5. Wednesday, 04.11.2020: Lecture 4 (pre-recorded)
  6. Wednesday, 11.11.2020: Lecture 5 (pre-recorded)
  7. Wednesday, 18.11.2020: Lecture 6 (pre-recorded)
  8. Wednesday, 25.11.2020: Lecture 7 (pre-recorded)
  9. Wednesday, 02.12.2020: Zoom Meeting 14:00-16:00 (Assignment 1 / Presentations)
  10. Wednesday, 09.12.2020: Lecture 8 (pre-recorded)
  11. Wednesday, 16.12.2020: Lecture 9 (pre-recorded), Zoom Meeting 14:00-16:00 (Assignment 2)
  12. Wednesday, 23.12.2020: Holiday
  13. Wednesday, 30.12.2020:
  14. Wednesday, 06.01.2021: Lecture 10 (pre-recorded)
  15. Wednesday, 13.01.2021: Lecture 11 (pre-recorded), Zoom Meeting 14:00-16:00 (Assignment 2)
  16. Wednesday, 20.01.2021: To be announced / exams
  17. Wednesday, 27.01.2021: To be announced / exams

Literature