Parallel Computing

Parallel Computing

DM818, Fall 2009

Daniel Merkle

News

14.12.2009: Details for the oral exam on January, 5th are online. You can choose a slot that you prefer on Thursday, Dec. 17th (in the lecture where the presentations for mandatory assignment 4 are given) and until Friday (Dec., 18th, 12am) in the IMADA secretary's office.

14.12.2009: Weekly notes (week 51) are online. A schedule for the presentations to be given on Thursday, Dec 17th is included.

14.12.2009: Slide set for week40 (Chapter 2, week40.Parallel.Programming.Platforms) was updated, as the last two slides (Fat Wraparound Mesh vs Hypercube) were missing.

8.12.2009: The results for mandatory assignment 1 can be found here.

8.12.2009: Weekly notes (week 50) including exercises are online. Note that you should prepare a short presentation (10 - 15 minutes) for the mandatory assignment 4, that has to be given on Thursday, December, 17th, 8:00 - 10:00am

30.11.2009: Weekly notes (week 49) including exercises are online.

24.11.2009: Weekly notes (week 48) are online. Do not forget the deadline for the third mandatory assignment Friday, November, 27th, 10:00am.

16.11.2009: Weekly notes (week 47) including exercises are online. Do not forget the deadline for phase 1 of the fourth mandatory assignment Friday, November, 20th, 10:00am.

09.11.2009: Weekly notes (week 46) including exercises are online. Note that it includes also some suggestions for the Fourth Mandatory Assignment.

02.11.2009: The Fourth (and last) Mandatory Assignment was published. Deadline for phase 1 of this assignment Friday, November, 20th, 10:00am.

02.11.2009: The Third Mandatory Assignment was published. Deadline for this assignment Friday, November, 27th, 10:00am.

02.11.2009: Slides for week 45 and week 46 were uploaded.

30.10.2009: Exercises for week 45 (and 46) are online.

29.10.2009: Weekly notes for week 45 are online.

12.10.2009: Quarter Break.

08.10.2009: Deadline for second mandatory assignment was shifted to Monday, October, 12th, 10:00am.

06.10.2009: Chapter 3: "The Linked Cell Method for Short-Range Potentials" from the book "Numerical Simulation in Molecular Dynamics" by Griebel et al. was uploaded in the Blackboard System. You can access the whole book via the SDU library proxy: here.

Schedule

Week 35 36 37 38 39 40 41
Mon 08-10 (Seminar Room) Lecture Lecture Lecture Lecture Lecture Lecture
Thu 16-18 (Seminar Room) Lecture Lecture Exercises Lecture Exercises Lecture Exercises
Week 45 46 47 48 49 50 51
Mo 14-16 (Seminar Room) Lecture Lecture Lecture Lecture Lecture Lecture Lecture
Thu 08-10 (Seminar Room) Exercises Exercises Exercises Exercises Exercises Exercises Presentation

Weekly Notes / Tutorial Exercises

The slides (and additional material) presented in the lectures can be found in the Blackboard System.

DateTopicNotes
Week 35 Introduction / Overview
Week 36 Single Processor Machines: Memory Hierarchies and Processor Features, Tuning Matrix Multiply Weekly Notes
Week 37 Introduction to Parallel Machines and Programming Models Weekly Notes (including exercises for week 37)
Week 38 Parallel Computer Architecture: A Hardware/Software Approach / Distributed Memory Machines and Programming Weekly Notes
Week 39 Distributed Memory Machines and Programming - MPI, Simulation Weekly Notes, Exercises for Week 39
Week 40 Simulation, Cost Model, Mapping, Platforms, Design Weekly Notes
Week 41 Design, Basic Communication Weekly Notes, Exercises for Week 41
DateTopicNotes
Week 45 Analytical Modelling of Parallel Programs Weekly Notes, Exercises for Week 45 (and 46)
Week 46 Analytical Modelling of Parallel Programs, Dense Matrix Algorithms Weekly Notes and Exercises for week 46 (and 47). Includes suggestions for the Fourth Mandatory Assignment.
Week 47 Dense Matrix Algorithms, Sorting Weekly Notes and Exercises for week 47 (and 48)
Week 48 Sorting, Graph Algorithms Weekly Notes for week 48
Week 49 Graph Algorithms Weekly Notes for week 49
Week 50 Search Algorithms for Discrete Optimization Problems Weekly Notes for week 50
Week 51 Dynamic Programming Weekly Notes for week 51 (including schedule for presentations on Thursday, Dec. 17th

Office Hours

Just write a short mail, and come by.

  • Office: IMADA, 14-602b-2 map.
  • Phone: 2322
  • E-mail: daniel

Literature

Main course book:

[1] Grama, A; A. Gupta; G. Karypis; V. Kumar: Introduction to Parallel Computing. Pearson, 2003. Errata by John Kirk

Additional reading information is given on the lecture slides.

Additional reading can also be found in the Blackboard System

.

Course Description

Prerequisites:

The contents of DM507 Algorithms and Data Structures must be known.

Aims:

The goal of this course to introduce the students to the aspects of parallel computing: architecture, programming paradigms, algorithms and standards. Both traditional computer science algorithms (e.g. sorting, searching, and dynamic programming algorithms) as well as scientific computing algorithms (e.g. matrix computations) will be covered. Students learn how to apply the most widely used standards for writing parallel programs (MPI, Pthreads, and OpenMP) and to thoroughly quantify the performance of parallel programs by means of metrics for scalability.

Synopsis:

parallel programming platforms, principles of parallel algorithm design, basic communication operations, analytical modeling of parallel programs, programming using the message passing paradigm, programming shared address space platforms, dense matrix algorithms, sorting, graph algorithms, search algorithms for discrete optimization problems, dynamic programming, fast fourier transform

Teaching period:

Fall 2009

Aim description:

When the course is completed the students are expected to be able to:
- explain the techniques and algorithms from the curriculum in clear and precise language.
- analyze the parallel systems covered in the curriculum with respect to performance and scalability.
- apply parallel programming techniques by implementing the techniques and algorithms from the curriculum in example programs.
- undertake empirical studies for the parallel implementations and draw sound conclusions.

Evaluation:

(a) Project assignments. Pass/fail, internal evaluation by teacher. The assignments must be passed in order to take the oral exam.
(b) Oral exam at the end of the course. Danish 7 mark scale, external examiner.

Reexamination according to the rules decided by the Study Board. Oral exam. Danish 7 mark scale, external examiner.

Course type:

Lectures and Tutorials.

Design by 1234.info | Modified by Daniel Merkle | CSS 2.0