184.727 Parallel Algorithms
This course is in all assigned curricula part of the STEOP.
This course is in at least 1 assigned curriculum part of the STEOP.

2020W, VU, 2.0h, 3.0EC


  • Semester hours: 2.0
  • Credits: 3.0
  • Type: VU Lecture and Exercise
  • Format: Online

Learning outcomes

After successful completion of the course, students are able to

  • apply the basics of scheduling theory
  • classify scheduling problems
  • apply and analyze approximation algorithms for scheduling problems
  • apply scheduling theory in a parallel computing context


Subject of course

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, simulations and scheduling.

Teaching methods

Lectures, active aprticipatiopn, project work

Mode of examination


Additional information


  • Florian Jaehn and Erwin Pesch. Ablaufplanung. Springer, 2014
  • Oliver Sinnen. Task Scheduling for Parallel Systems. Wiley, 2007
  • Yves Robert and Frédéric Vivien, eds. Introduction to Scheduling. Chapman & Hall/CRC, 2010
  • Maciej Drozdowski. Scheduling for Parallel Processing. Springer, 2009
  • Michael L. Pinedo. Scheduling - Theory, Algorithms, and Systems. 3rd ed. Springer, 2008
  • Peter Brucker. Scheduling algorithms. 5th ed. Springer, 2007
  • Joseph Y-T. Leung, ed. Handbook of Scheduling: Algorithms, Models and Performance Analysis. Chapman & Hall/CRC, 2004

ECTS Breakdown:

  • Lectures: 1 ECTS
  • Study: 1 ECTS
  • Exercises: 1 ECTS
  • Planning, Overview: 2h
  • Lectures: 24h (ca. 12 times 2h)
  • Exercises, presentation: 6h (ca. 3 times 2h)
  • Own Study: 20h
  • Preparation for exercises: 23h

Total: 25h = 3ECTS



Course dates

Wed14:00 - 16:0004.11.2020 (LIVE)Zoom Meeting
Wed14:00 - 16:0002.12.2020 (LIVE)Zoom Meeting
Wed14:00 - 16:0016.12.2020 (LIVE)Zoom Meeting
Wed14:00 - 16:0013.01.2021 (LIVE)Zoom Meeting

Examination modalities

Project submission, project presentation, oral examination


Course registration

Begin End Deregistration end
09.09.2020 12:00 04.11.2020 00:00 27.11.2020 23:59


Study CodeObligationSemesterPrecon.Info
066 646 Computational Science and Engineering Not specified
066 931 Logic and Computation Mandatory elective
066 932 Visual Computing Mandatory elective
066 937 Software Engineering & Internet Computing Mandatory elective
066 938 Computer Engineering Mandatory elective


No lecture notes are available.

Previous knowledge

Introduction to Parallel Computing

Preceding courses

Accompanying courses



if required in English