Parallel algorithms and programs (original) (raw)

This is a course for the first-year master students of the computer science department of ENS Lyon. The lessons are given by Frédéric Vivien. The pratical and exercises sessions are handled byJulien Herrmann andJean-Marie Madiot. You can find a good reference tutorial here, but don't hesitate to browse the web for documentation.

• TD 1: Sorting Networks
• TP 1: Hello World's in MPI - hello{1,2,3,4,5,6}.c
• TD 2: P-RAM
• TP 2: Distributed sort
• TP 3: Distributed matrix multiplication - <tp3.tar.gz>
• TD 3: P-RAM 2
• TP 4: LU factorisation (distributed memory) - <tp4.c>, <tp4.sh>
• TP 5: LU factorisation (shared memory) - <tp5.c> <helloworldopenmp.c>
• TD 4: Task graph scheduling
• TD 5: Scheduling, II
• TD 6: Nested loops

Homework

Subject of the homework: <dm.pdf>.

You can work in teams, but never more than two.

The homework is due Sunday, December 7, 23h59, Lyon time. Please take notice that if you're n hours late, we will subtract n from your grade. Send your archive to both Julien and Jean-Marie.