Timetable
Organization
Lecture Topics and Materials
|
|
Parallel Algorithms and Applications
- Typ:
- Spezialvorlesung
- Veranstalter:
- Prof. Dr. Amitava Datta and Prof. Dr. Thomas Ottmann
- Zeit und Ort:
- Do 14-16, Di. 11-12, MMR 00-031, Geb. 051
- Übungen:
- Di. 12-13, MMR 00-031, Geb. 051
- Klausur (exam):
- Mo. 27.08.2001, 10:00 - 12:00; 03-026, Geb. 051
Parallel algorithms are extremely important for solving large problems from
many application domains. In this course, we will study several fundamental
techniques for designing parallel algorithms and use these techniques for
designing parallel algorithms from different domains.
We will discuss different models of parallel computation including the PRAM model
and network models like the hypercube and mesh. We will study basic techniques like
prefix sum, list ranking, merging, sorting and searching. We will use these
techniques for designing parallel algorithms for graph theoretic, geometric, string
processing and image processing problems.
Literatur zur Veranstaltung
- Joseph JaJa :
An Introduction to Parallel Algorithms,
Addison-Wesley,
ISBN 0-201-54856-9,
1992.
- Selim G. Akl :
The Design and Analysis of Parallel Algorithms,
Prentice-Hall,
ISBN 0-13-200073-3,
1993.
- We will mention references to other literature later.
|