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.

2019W, VU, 2.0h, 3.0EC

Properties

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

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

Immanent

Additional information

Books

  • 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

Lecturers

Institute

Course dates

DayTimeDateLocationDescription
Wed14:00 - 16:0002.10.2019 - 22.01.2020FAV Hörsaal 3 Zemanek (Seminarraum Zemanek) Parallel Algorithms
Wed14:00 - 16:0030.10.2019Seminarraum 127 Parallel Algorithms
Parallel Algorithms - Single appointments
DayDateTimeLocationDescription
Wed02.10.201914:00 - 16:00FAV Hörsaal 3 Zemanek (Seminarraum Zemanek) Parallel Algorithms
Wed09.10.201914:00 - 16:00FAV Hörsaal 3 Zemanek (Seminarraum Zemanek) Parallel Algorithms
Wed16.10.201914:00 - 16:00FAV Hörsaal 3 Zemanek (Seminarraum Zemanek) Parallel Algorithms
Wed23.10.201914:00 - 16:00FAV Hörsaal 3 Zemanek (Seminarraum Zemanek) Parallel Algorithms
Wed30.10.201914:00 - 16:00Seminarraum 127 Parallel Algorithms
Wed06.11.201914:00 - 16:00FAV Hörsaal 3 Zemanek (Seminarraum Zemanek) Parallel Algorithms
Wed13.11.201914:00 - 16:00FAV Hörsaal 3 Zemanek (Seminarraum Zemanek) Parallel Algorithms
Wed20.11.201914:00 - 16:00FAV Hörsaal 3 Zemanek (Seminarraum Zemanek) Parallel Algorithms
Wed27.11.201914:00 - 16:00FAV Hörsaal 3 Zemanek (Seminarraum Zemanek) Parallel Algorithms
Wed04.12.201914:00 - 16:00FAV Hörsaal 3 Zemanek (Seminarraum Zemanek) Parallel Algorithms
Wed11.12.201914:00 - 16:00FAV Hörsaal 3 Zemanek (Seminarraum Zemanek) Parallel Algorithms
Wed18.12.201914:00 - 16:00FAV Hörsaal 3 Zemanek (Seminarraum Zemanek) Parallel Algorithms
Wed08.01.202014:00 - 16:00FAV Hörsaal 3 Zemanek (Seminarraum Zemanek) Parallel Algorithms
Wed15.01.202014:00 - 16:00FAV Hörsaal 3 Zemanek (Seminarraum Zemanek) Parallel Algorithms
Wed22.01.202014:00 - 16:00FAV Hörsaal 3 Zemanek (Seminarraum Zemanek) Parallel Algorithms

Examination modalities

Project submission, project presentation, oral examination

 

Course registration

Begin End Deregistration end
11.09.2019 12:00 06.11.2019 00:00 29.11.2019 23:59

Curricula

Literature

No lecture notes are available.

Previous knowledge

Introduction to Parallel Computing

Preceding courses

Accompanying courses

Miscellaneous

Language

if required in English