LIACS >Kristian Rietveld >Courses >Parallel Programming Spring 2015

Banner image shows DAS-4 nodes at Leiden University (adapted from photo by Vianney Govers)

Parallel Programming, Spring 2015

Lecturer: prof.dr. H. A. G. Wijshoff
Teaching/Lab Assistent: dr. K. F. D. Rietveld


The course presents an introduction to parallel programming and parallel architectures and subsequently the study of parallel algorithm design, parallel numerical computing, parallel graph computing and parallel sorting. Existing and new (parallel) programming paradigms will be discussed. The course lectures are completed with programming assignments and/or (theoretical) algorithmic problems.


Important: The exam will be in room B01 on Tuesday May 26 from 14:00 to 17:00 hrs.


40% assignments: choice of programming assignments and/or (theoretical) algorithmic problems. 60%: Open "book" final exam.


Assignment 1: Sparse LU Factorization. The skeleton code for this assignment can be found here. The deadline for this assignment is Monday March 30, 23:59 hours. Note: assignment text has been updated to describe how to generate B vectors for the matrices.

A clarification regarding the use of "pointers" in the assignment: it is fine to use pointers to keep references to dynamically allocated arrays. It is not okay to use pointers to reference matrix elements or array elements directly. In your data structure you must refer to array elements using array subscripts. See for instance the row_ptr array in the skeleton code, this is not an array of pointers but rather an array of array subscripts. Also, it is not okay to use pointer-linked data structures (linked list, pointer-linked graph or grid) in your implementation.

Assignment 2: Parallel Minimum Spanning Tree Algorithm. The deadline for this assignment is Monday May 4, 23:59 hours note: deadline extended!.

Note that your implementation should also handle disconnected graps, resulting in multiple spanning trees. Note also that as output you should report the total weight of each minimum spinning tree as well as the edges which belong to the spanning tree.

Assignment 3: Parallel Sparse LU Factorization. The deadline for this assignment is Monday June 29, 23:59 hours


Textbook: Introduction to Parallel Computing, Addison Wesley, 2003.

Lecture Slides:


One can contact the teaching assistent by e-mail: krietvel (at)

Class Schedule

Lectures: Mondays from 13:45 to 15:30 in room 403.

2 Feb 2015Introduction
9 Feb 2015No class: Dies Natalis
16 Feb 2015
23 Feb 2015
2 Mar 2015
9 Mar 2015
16 Mar 2015
23 Mar 2015
30 Mar 2015Deadline assignment 1
6 Apr 2015No class: Easter
13 Apr 2015
20 Apr 2015
27 Apr 2015No class: King's Day
4 May 2015Deadline assignment 2
11 May 2015
18 May 2015Additional class
Tue 26 May 201514:00 - 17:00 Exam in room B01!
29 June 2015Deadline assignment 3