SAUCE
Home
Events
Listing
Future
Previous
Accelerated Computing with GPUs 2020
Data Mining - Winter 20/21
High Performance Computing 2019
Einführung in die Bioinformatik WS19/20
Computational Logic
Parallel Algorithms and Architectures 2019
DSEA Praktikum 2018/19
Deep Learning 2018
High Performance Computing 2018
Parallel Algorithms and Architectures 2018
Datenstrukturen und effiziente Algorithmen Ws 18/19
EiP SoSe 18
bio-st-18
EiP WS 2017/18
High Performance Computing 2017
Datenstrukturen und effiziente Algorithmen WiSe 17/18
PS SS 2017
Einfuehrung in die Programmierung SS17
Parallel Algorithms and Architectures 2017
High Performance Computing 2016
DSEA 2016/17
EiP WS2016/17
Parallel Algorithms and Architectures 2016
PS SS 2016
Krypto SS 2016
EiP SS 2016
DSEA Praktikum WS 2015/16
DSEA WS 2015/16
News
Documentation
About
Changelog
Roadmap
Deutsche Dokumentation
Tips and Tricks
Test configuration
Language information
Contact
Login
High Performance Computing 2019
Pair Programming
Pair Programming
Sheet 2 (AVX Shuffles, Instruction Parallelism)
Sheet 3 (Stochastic PI, Shallow Deep Learning)
Sheet 4 (Conjugate Gradient with MPI, Asynchronous 2D Jacobi Partitioning)
Sheet 6 (std::async, block-cyclic distribution)
Sheet 7 (Atomics, Queue)
Sheet 8 (Sorting, Riemann Zeta)
Sheet 5 (Reverse-Engineering MPI, SUMMA)
Sheet 9 (Data Dependencies, Triangular Matrix Vector)
Sheet 10: Lockfree Hashmaps
Sheet 11 (Position Based Dynamics)
Sheet 12 ( Outer Product, Kmer Counting)
Tutorial 0: C++ Examples
Tutorials_extra
All Exercises
testSheet
Sheet 2 Redoable
Sheet 3 Redoable
Sheet 4 Redoable
Sheet 5 Redoable
Sheet 6 Redoable
Sheet 7 Redoable
Sheet 8 Redoable
Sheet 9 Redoable
Sheet 10 Redoable
Sheet 11 Redoable
Sheet 12 Redoable
Lecture 4: MPI PI
Lecture 3: AVX SOA normalization
Lecture 4: MPI PI
Lecture 5: Asynchronous 1D Jacobi Partitioning
Lecture 6: Interleaved SUMMA
Lecture 7: Thread distributions MVM
Lecture 8: Dynamic Schedule of All-Pairs distance computation
Lecture 9: 1NN classifier on MNIST data
Lecture 10: Backward Substitution
Lecture 11: Lockfree List using an Array
Lecture 11: Lockfree Hashmap
Lecture 12: Kepler Orbits
Lecture 4: MPI PI
Assignment
Scaffold Head
#include <iostream> #include <iomanip> #include <cstdint> #include <mpi.h> constexpr double pi = 3.1415926535897932384626433832795028841971693993751058; double residue (const double& result) { return (result > pi ? result-pi : pi-result); } int main (int argc, char * argv[]) { MPI::Init(argc , argv ); uint64_t num_intervals=0; const uint64_t num_ranks = MPI::COMM_WORLD.Get_size(); const uint64_t rank = MPI::COMM_WORLD.Get_rank(); // actual value of num_intervals only known to the root if (rank == 0) num_intervals = 1UL<<20;
Scaffold Foot
if (rank == 0) { const double error = residue(result); std::cout << std::setprecision(16) << "# pi: " << result << " residue: " << error << "\nParallel programming is " << (error < 1E-12 ? "fun!" : "error-prone!") << std::endl; } MPI::Finalize(); }
Start time:
Do 10 Okt 2019 10:15:00
End time:
Di 11 Feb 2020 10:15:00
General test timeout:
10.0 seconds
Tests
Command line arguments
4
Comment prefix
#
Given input
Expected output
Parallel programming is fun!