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.

2022W, VU, 2.0h, 3.0EC


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

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, pratical exercises

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: 75h = 3ECTS



Course dates

Wed14:00 - 16:0012.10.2022 - 25.01.2023Seminarraum AE U1 - 4 Lecture
Parallel Algorithms - Single appointments
Wed12.10.202214:00 - 16:00Seminarraum AE U1 - 4 Lecture
Wed09.11.202214:00 - 16:00Seminarraum AE U1 - 4 Lecture
Wed25.01.202314:00 - 16:00Seminarraum AE U1 - 4 Lecture

Examination modalities

Part 1
- sucessful completion of excersices

Part 2
- oral exam


Course registration

Begin End Deregistration end
19.09.2022 12:00 11.10.2022 00:00 15.11.2022 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

Parallel Computing

Preceding courses

Accompanying courses


  • Attendance Required!