Skip to content

Repository files navigation

The Distributed and Parallel Algorithms Implementation Challenge

This repository will be updated with all the optional exercises and results. The current standings will also stay updated on this front page. See the readme in each folder for results on a particular exercise.

The scoring system we use works as follows. On each exercise, the submissions are sorted based on parallel running time. The fastest submission will score 20 points, the second fastest 19, and so on down to one. The only exception to this rule is the first exercise, where the points scored are multiplied by $0.5$. Otherwise, the points from each exercise are accumulated to determine the winning team. Note that the two best teams will win Algorithm Engineering coffee cups.

Results

To know your team's ID, check the feedback from the first round on Moodle. The names listed were included with the permission of the individuals.

ID Points Name
10 103 Leo Silz 🥇
2 93.5 Markus Everling and Olga Sergeyeva 🥈
6 82.5 Jacob Rose and Eric Waldherr 🥉
9 54
11 53.5
3 46.5
14 38
8 37.5
13 25.5
7 17
4 6
12 5.5
5 5
1 3

About

Optional exercises for the Distributed and Parallel Algorithms lecture

Resources

Stars

1 star

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages