Module Handbook

  • Dynamischer Default-Fachbereich geändert auf INF

Module INF-62-54-M-5

Parallel Computing (M, 4.0 LP)

Module Identification

Module Number Module Name CP (Effort)
INF-62-54-M-5 Parallel Computing 4.0 CP (120 h)

Basedata

CP, Effort 4.0 CP = 120 h
Position of the semester 1 Sem. in SuSe
Level [5] Master (Entry Level)
Language [EN] English
Module Manager
Lecturers
Area of study [INF-ES] Embedded Systems and Robotics
Reference course of study [INF-88.79-SG] M.Sc. Computer Science
Livecycle-State [NORM] Active

Courses

Type/SWS Course Number Title Choice in
Module-Part
Presence-Time /
Self-Study
SL SL is
required for exa.
PL CP Sem.
2V+1U INF-62-54-K-5
Parallel Computing
P 42 h 78 h
U-Schein
ja PL1 4.0 SuSe
  • About [INF-62-54-K-5]: Title: "Parallel Computing"; Presence-Time: 42 h; Self-Study: 78 h
  • About [INF-62-54-K-5]: The study achievement "[U-Schein] proof of successful participation in the exercise classes (ungraded)" must be obtained.
    • It is a prerequisite for the examination for PL1.

Examination achievement PL1

  • Form of examination: written or oral examination
  • Examination Frequency: each semester
  • Examination number: 66256 ("Parallel Computing")
    Type of examination will be announced in the lecture. Duration of the examination: ref. examination regulations.

Evaluation of grades

The grade of the module examination is also the module grade.


Contents

The lecture deals with parallel systems on thread level, especially
  • important parallel algorithms (PRAM algorithms)
  • parallel sorting methods (Batch Sorting Networks)
  • systolic calculation fields
  • multiprocessor systems with shared memory
    • interconnection networks: permutation networks, Banyan/Beneš networks
    • cache coherence protocols
    • weak memory consistency
  • programming languages: OpenCL, OpenMP, MPI

Competencies / intended learning achievements

Upon successful completion of the module, students will be able to
  • analyze the runtime complexity of parallel algorithms,
  • evaluate parallel algorithms with regard to their efficiency,
  • design parallel algorithms,
  • design systems as systolic arithmetic fields,
  • select suitable connection networks,
  • understand cache and storage behavior,
  • understand smaller programs in OpenCL or OpenMP.

Literature

  • J. Jájá: Parallel Algorithms, Addison-Wesley, 1992
  • J.H. Reif: Synthesis of Parallel Algorithms, Morgan Kaufmann, 1993
  • B. Parhami; Computer Architecture: From Microprocessors to Supercomputers; Oxford University Press, 2005
  • T. Rauber and G. Ruenger: Parallele Programmierung, Springer, 2007
  • S. Hoffmann and R. Lienhart: OpenMP -- Eine Einführung in die parallele Programmierung mit C/C++, Springer, 2008
  • M. Scarpino: OpenCL in Action, Manning, 2012

Requirements for attendance of the module (informal)

None

Requirements for attendance of the module (formal)

None

References to Module / Module Number [INF-62-54-M-5]

Course of Study Section Choice/Obligation
[INF-88.79-SG] M.Sc. Computer Science [Specialisation] Specialization 1 [WP] Compulsory Elective
[INF-88.79-SG] M.Sc. Computer Science [Specialisation] Specialization 1 [WP] Compulsory Elective
[INF-88.79-SG] M.Sc. Computer Science [Specialisation] Specialization 1 [WP] Compulsory Elective
[EIT-88.A20-SG#2021] M.Sc. European Master in Embedded Computing Systems (EMECS) [2021] [Free Elective Area] Elective Subjects [W] Elective Module
[EIT-88.D55-SG#2021] M.Sc. Embedded Computing Systems (ESY) [2021] [Free Elective Area] Elective Subjects [W] Elective Module
Module-Pool Name
[INF-ES_Ba_V-MPOOL-4] Specialization Bachelor TA Embedded Systems and Robotics
[MV-MB-INF-2022-MPOOL-6] Wahlpflichtmodule M.Sc. Maschinenbau mit angewandter Informatik 2022
[MV-MBINFO-MPOOL-6] Wahlpflichtmodule Maschinenbau mit angewandter Informatik