|
| 1 | +<!DOCTYPE HTML> |
| 2 | +<!-- |
| 3 | + Editorial by HTML5 UP |
| 4 | + html5up.net | @ajlkn |
| 5 | + Free for personal and commercial use under the CCA 3.0 license (html5up.net/license) |
| 6 | +--> |
| 7 | +<html> |
| 8 | + <head> |
| 9 | + <title>Algorithm Engineering Group Heidelberg</title> |
| 10 | + <meta charset="utf-8" /> |
| 11 | + <meta name="viewport" content="width=device-width, initial-scale=1, user-scalable=no" /> |
| 12 | + <link rel="stylesheet" href="assets/css/main.css" /> |
| 13 | + </head> |
| 14 | + <body class="is-preload"> |
| 15 | + |
| 16 | + <!-- Wrapper --> |
| 17 | + <div id="wrapper"> |
| 18 | + |
| 19 | + <!-- Main --> |
| 20 | + <div id="main"> |
| 21 | + <div class="inner"> |
| 22 | + |
| 23 | + <!-- Header --> |
| 24 | + <header id="header"> |
| 25 | + <a href="teaching_ss2023.html" class="logo"><strong>Summer</strong> Semester 2025</a> |
| 26 | + </header> |
| 27 | +<br> |
| 28 | +<br> |
| 29 | +<header class="major"> |
| 30 | + <h2> Lecture, Distributed and Parallel Algorithms</h2> |
| 31 | + </header> |
| 32 | + |
| 33 | + |
| 34 | + <!-- Banner --> |
| 35 | + <section id="banner2"> |
| 36 | +<div class="content"> |
| 37 | + The lecture takes place in <b>presence</b> in SR TBA, dates TBA. The first lecture takes place on the TBA. <br> |
| 38 | + <!--The link to Moodle and LSF will be disclosed later.--> |
| 39 | + The link to the Moodle of the lecture is <a href="https://moodle.uni-heidelberg.de/course/view.php?id=16779">here</a>. |
| 40 | + <!--Link to the lecture in LSF is <a href="https://lsf.uni-heidelberg.de/qisserver/rds?state=verpublish&status=init&vmfile=no&publishid=385835&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung">here</a>.--> |
| 41 | + <br> |
| 42 | + <br> |
| 43 | + |
| 44 | +<header class="minor"> |
| 45 | + <h3>More lecture details:</h3></header> |
| 46 | + <div class="content"> |
| 47 | +<br> |
| 48 | +<p><b>Goals:</b> |
| 49 | +Students understand fundamental theoretical and practical concepts of advanced parallel algorithms and data structures, get to know established methods and algorithms, are familiar with issues of efficient implementations, are able to identify/formulate algorithmic problems in/for different application areas where parallel or distributed algorithms are used, are able to analyse new distributed and parallel algorithms as well as analysing their running time, and select appropriate algorithms for parallel and distributed applications -- students are able to apply parallel and distributed algorithms and data structures to real-world problems, and can objectively assess the quality of the results. |
| 50 | +</p> |
| 51 | + |
| 52 | +<p><b>Content:</b> |
| 53 | +Introduction to distributed and parallel algorithms, |
| 54 | +PRAM model, design and analysis of parallel and distributed algorithms, isoefficiency, UMA vs. NUMA, memory consistency for shared-memory, communication models (with and without network, fully interconnected with half duplex or full duplex, BSP), critical path lengths, parallel associative operations, reduction operations, matrix multiplication, broadcast operations, MPI basic toolbox, ranking, parallel sorting (multiway merge, quick sort, sample sort), prefix sums, all-to-all communication, map-reduce, list ranking, parallel graph algorithms (minimum spanning trees, connected components, shortest paths, graph partitioning), process mapping, communication-free parallel graph generation, parallel sampling algorithms. |
| 55 | + |
| 56 | +</p> |
| 57 | + |
| 58 | +<p><b>Prerequisites:</b> |
| 59 | +Recommended: |
| 60 | +Einführung in die Praktische Informatik (IPI), |
| 61 | + Programmierkurs (IPK), |
| 62 | + Algorithmen und Datenstrukturen (IAD), |
| 63 | + Lineare Algebra 1 |
| 64 | + |
| 65 | + </p> |
| 66 | +<p><b>Leistungspunkte:</b> 8 LP </p> |
| 67 | +<p><b>Duration: </b>one semester</p> |
| 68 | +<p><b>Teaching mode:</b> 4 SWS lecture (in English), 2 SWS tutorial, homework assignments</p> |
| 69 | +<p><b>Workload:</b> 240h; thereof 90h lectures and tutorials, 15h exam preparations, 135h lecture wrap-up and homework </p> |
| 70 | + |
| 71 | +<p><b>Passing the course:</b> |
| 72 | +Successful participation in the exercises (at least 50\% of total achievable points) and passing an oral exam </p> |
| 73 | + |
| 74 | +<p><b>Verwendbarkeit:</b> |
| 75 | + <br> M.Sc. Data and Computer Science,<br> M.Sc. Scientific Computing, <br> Lehramt </p> |
| 76 | + </div> |
| 77 | + </div> |
| 78 | + |
| 79 | + </section> |
| 80 | + </div> |
| 81 | + </div> |
| 82 | + |
| 83 | + <!-- Sidebar --> |
| 84 | + <!-- Sidebar --> |
| 85 | + <div id="sidebar"> |
| 86 | + <div class="inner"> |
| 87 | + <footer id="footer"> |
| 88 | +<img src="logo3.png" width=250> |
| 89 | +</footer> |
| 90 | + |
| 91 | + <!-- Menu --> |
| 92 | + <nav id="menu"> |
| 93 | + <ul> |
| 94 | + <li><a href="index.html">News</a></li> |
| 95 | + <li><a href="team.html">Group Members</a> |
| 96 | + </li> |
| 97 | + <li><a href="research.html">Research</a></li> |
| 98 | + <li><a href="opensource.html">Open Source</a></li> |
| 99 | + |
| 100 | + <li><a href="publications.html">Publications</a></li> |
| 101 | + <li> |
| 102 | + <span class="opener">Teaching</span> |
| 103 | + <ul> |
| 104 | + <li><a href="teaching_opentopics.html">Open Thesis Topics</a></li> |
| 105 | + <li><a href="teaching_ws2025.html">Winter Semester 2024/2025</a></li> |
| 106 | + |
| 107 | + <li><a href="teaching_ss2024.html">Summer Semester 2024</a></li> |
| 108 | + <li><a href="teaching_ws2024.html">Winter Semester 2023/2024</a></li> |
| 109 | + <li><a href="teaching_ss2023.html">Summer Semester 2023</a></li> |
| 110 | + <li><a href="teaching_ws2023.html">Winter Semester 2022/2023</a></li> |
| 111 | + <li><a href="teaching_ss2022.html">Summer Semester 2022</a></li> |
| 112 | + <li><a href="teaching_ws2022.html">Winter Semester 2021/2022</a></li> |
| 113 | + <li><a href="teaching_ss2021.html">Summer Semester 2021</a></li> |
| 114 | + <li><a href="teaching_ws2021.html">Winter Semester 2020/2021</a></li> |
| 115 | + </ul> |
| 116 | + </li> |
| 117 | + <li><a href="openpos.html">Open Positions</a></li> |
| 118 | + <li><a href="contact.html">Contact</a></li> |
| 119 | + </ul> |
| 120 | + </nav> |
| 121 | + |
| 122 | + <!-- Footer --> |
| 123 | + <footer id="footer"> |
| 124 | + <img src="images/math_inf_dt.png" width="200px"> |
| 125 | + <img src="heidelberg-university.png" width="200px"> |
| 126 | + |
| 127 | +<p class="copyright">© Copyright Universität Heidelberg <br> <a href="http://www.uni-heidelberg.de/kontakt.html#impressum">Impressum</a> |
| 128 | + <br> <a href="https://www.uni-heidelberg.de/datenschutzerklaerung_web.html">Datenschutzerklärung</a></p> |
| 129 | + </footer> |
| 130 | + |
| 131 | + </div> |
| 132 | + </div> |
| 133 | + |
| 134 | + </div> |
| 135 | + |
| 136 | + <!-- Scripts --> |
| 137 | + <script src="assets/js/jquery.min.js"></script> |
| 138 | + <script src="assets/js/browser.min.js"></script> |
| 139 | + <script src="assets/js/breakpoints.min.js"></script> |
| 140 | + <script src="assets/js/util.js"></script> |
| 141 | + <script src="assets/js/main.js"></script> |
| 142 | + |
| 143 | + </body> |
| 144 | +</html> |
0 commit comments