ICS-E4020 Programming Parallel Computers

Spring 2016 · Department of Computer Science · Aalto University

News Overview Exercises Material Additional reading

News

Please note that all information here is related to spring 2016. You can find the web pages of spring 2017 here.

Overview

This is a practical hands-on course on algorithm engineering for modern parallel computers. You will learn how to design programs that make the best possible use of the computing power of multicore CPUs and GPUs.

Schedule

Systems

Please use the same user name on both GitHub and Slack. Please also make sure your real name (first name + last name) is set correctly in Slack. In Slack, join channels #mf, #cp, #is, and #so for task-specific discussions, channel #prereq for support with the prerequisite test and Github accounts, and channel #feedback to give feedback on this course.

Lecturers

Teaching assistants

Prerequisites

A good understanding of computer programming, algorithms and data structures, and a working knowledge of either C or C++ programming language. You will need to complete a prerequisite test before you can start to solve assignments.

Required parts

Solve programming exercises, correctly and efficiently, and return your solutions on time via GitHub. There are both “basic exercises” and “challenging exercises”. If you solve all basic exercises correctly, you can get up to 60 points. You will need at least 30 points for a grade of 1/5 and at least 50 points for a grade of 5/5.

Optional parts

There are 6 × 1 lectures and 6 × 2 exercises sessions, which you are encouraged to attend. You can also take part in the online discussions in Slack.

In addition to basic exercises, there are also plenty of more challenging exercises. The course ends with a contest in which the fastest solutions get additional points. You can solve challenging exercises instead of basic exercises, or in addition to basic exercises. You can get much more than 60 points in total, and the students with the highest number of points will get a special award.

Workload

5 credits / 6 week ≈ 22 hours of work per week.

Exercises

The following table shows how many points you can get from each task (assuming it meets all requirements), depending on when you return it. All deadlines are on Sundays, at 23:59. The deadlines are strict; in particular, you will not get any points for any solution that you return after Sunday, 22 May, at 23:59. In case of illness, please get a doctor’s certificate and contact the lecturer ASAP.

Deadlines

Week 1Week 2Week 3Week 4Week 5Week 6Feedback
17 April24 April1 May8 May15 May22 May2 June
median filtering
MF15 R33333
MF255 R3333
MF3 × +555555
MF4 × +555555
correlated pairs
CP15 R33333
CP255 R3333
CP3555 R333
CP4 +555 R333
CP5 × #555555
CP6 × #555555
CP7 × #555555
CP81010101010 R6
CP9 +101010101010 R
image segmentation
IS1 +5555 R33
IS2 ×555555
IS3 ×555555
sorting
SO1 +5555 R33
SO2 × +555555
SO3 ×555555
SO4 ×555555
contest7
feedback1 R

Symbols

R = recommended path. If you follow this path, you will get 10 points per week, plus 1 point for providing course feedback, i.e., 61 points in total. For the grade of 5/5, you will need at least 50 points.

× = challenging tasks. Yes, it is possible to pass the course with more than 100 points in total!

+ = these problems take part in the contest – bonus points are available for the fastest solutions!

# = open-ended tasks. We do not provide any specific time limits, code templates, or automatic grading scripts. In these tasks you are also expected to write a short report (instead of or in addition to doing some programming). You will submit your solution via GitHub, but our teaching assistants will do the grading.

Grading

For normal tasks, we will provide a code template and an automatic grading script. For these tasks, the grading is based on the following principles:

See the grading script for more details regarding the point thresholds of each task (run ./grading info).

You can resubmit your solutions at any point during the course, for any reason, and it will be graded again as if it was your first submission. You will never lose any points by resubmitting; we will keep track of the highest number of points that you have got for each task. Even if you have already got full points for a task, you can nevertheless resubmit your solutions later in order to do better in the contest.

Computers

For benchmarking, use the computers in Maari-A classroom:

For remote access, first open an ssh connection to one of the general-purpose Linux servers (kosh.aalto.fi, lyta.aalto.fi) and then ssh to one of the classroom computers (albatrossi, broileri, dodo, drontti, emu, fasaani, flamingo, iibis, kakadu, kalkkuna, karakara, kasuaari, kiuru, kiwi, kolibri, kondori, kookaburra, koskelo, kuukkeli, lunni, moa, pelikaani, pitohui, pulu, ruokki, siira, strutsi, suula, tavi, tukaani, undulaatti).

Computers in Maari-C should be identical to those in Maari-A, and you may consider using them, too (akaatti, akvamariini, ametisti, baryytti, berylli, fluoriitti, granaatti, hypersteeni, jade, jaspis, karneoli, korundi, kuukivi, malakiitti, meripihka, opaali, peridootti, rubiini, safiiri, sitriini, smaragdi, spektroliitti, spinelli, timantti, topaasi, turkoosi, turmaliini, vuorikide, zirkoni).

Submitting solutions, receiving feedback

We will use the Git version control system, Git repositories on GitHub servers, and an automatic grading tool that you can run locally. Read the instructions on the GitHub workflow for more details.

Course material

There is no textbook. Lecture slides and additional material will be posted here after each lecture.

In the meantime, you can have a look at the course material from 2015.

Lectures

Exercises

Other material

Additional reading

Hardware

Programming: OpenMP and shared memory

Programming: SIMD

Programming: CUDA

Programming: OpenCL

Programming: other

Tools: version control

Tools: profiling and debugging

History