Advanced Parallel Algorithms

Lecturer:

Tutor:

Supervisor:

Department of Computer Science and Engineering

Synopsis:

Design and analysis of time-, and cost-efficient PRAM

algorithms and parallel algorithms for distributed memory

machines. The collection of algorithms includes: advanced parallel

scan algorithms, distributed list ranking, Cole's MergeSort, optimal mesh sort,

connected components, tree contraction and tree evaluation, pattern matching in texts.

Requirements:

Syllabus of lectures:

Syllabus of tutorials:

Study Objective:

Study materials:

J. H. Reif, ed. Synthesis of parallel algorithms, Morgan Kaufmann Publ., 1993, ISBN 1-55860-135-X

Note:

Time-table for winter semester 2011/2012:

Time-table is not available yet

Time-table for summer semester 2011/2012:

Time-table is not available yet

The course is a part of the following study plans:

• Doctoral studies, daily studies (compulsory elective course)
• Doctoral studies, combined studies (compulsory elective course)
• Doctoral studies, structured daily studies (compulsory elective course)
• Doctoral studies, structured combined studies (compulsory elective course)