Parallel and Distributed Algorithms

Winter 2006/2007, T3, ThBI; old T2

Lecturer: Prof. Dr. G. Schnitger

Office hours:

Dipl. S.C. Ionescu : We 11:0 am - 01:00 pm, Room 313
Prof. Dr. G. Schnitger : Tue 10:00 - 12:00, Room 302

Classes: Mo 12:00 - 14:00, Tue 08:00 - 10:00 (Magnus lecture room).

Tutorials: Mo 08:15 - 9:45 SR 11

Announcements

Assignments will be distributed each monday before classes. Alternatively solutions can be dropped in the mailbox next to room 313. The same deadline applies.

Assignments so far (in pdf):

To obtain a certificat for the course (Leistungsnachweis) the tutorials have to be attended regulary and actively. Moreover at least 60% of the maximal score has to be obtained.

Lecture notes

Slides

Chapter 1-2 Pdf or Pdf ziped and as printable version
Chapter 3 Pdf or Pdf ziped and as printable version
Chapter 4 Pdf or Pdf ziped and as printable version
Chapter 5 Pdf or Pdf ziped and as printable version
Chapter 6 Pdf or Pdf ziped and as printable version
Chapter 7 Pdf or Pdf ziped and as printable version
Chapter 8 Pdf or Pdf ziped and as printable version
Chapter 9 Pdf or Pdf ziped and as printable version
Chapter 10 Pdf or Pdf ziped and as printable version
Chapter 11 Pdf or Pdf ziped and as printable version
Chapter 12 Pdf or Pdf ziped and as printable version

Prerequisites: An introductiory course in algorithms as well as background in calculus, linear algebra and elementary probability theory.

Literature:

M.J. Quinn, Parallel Programmin in C with MPI and OpenMP, McGraw Hill, 2004;
A. Gramme, A. Gupta, G. Karypis and V. Kumar, Introduction to parallel Computing, second edition, Addison Welsley, 2003
J. Jaja, An Introduction to Parallel Algorithms, Addison-Wesley 1992;

Oral exams for CSC students:

Examination dates are offered for december 18 and 19. To fix a date please contact Prof. Schnitger. See Dr. Engel for the registration of the exam. Registration is possible no later than four weeks before the examination date.