![]() ![]() Lectures: Thursdays from 13:30 to 15:15 in room 401. One can contact the lecturer by e-mail: harryw (at) Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar. Textbook (not obligatory): Introduction to Parallel Computing. The deadline for this assignment is Friday December 21, 23:59 hours. The goal of this course is to provide a deep understanding of the fundamental principles and engineering trade-offs involved in designing modern parallel computing systems as well as to teach parallel programming techniques necessary to effectively utilize these machines. The total weight of each minimum spinning tree as well as theĪssignment 3: Parallel Sorting Algorithm. Note also that as output you should report Note that your implementation should also handle disconnected graphs, resulting High-performance computing (HPC) uses supercomputers and computer clusters to solve advanced computation problems. The deadline for this assignment is Wednesday November 28, 23:59 hours The deadline for this assignment is Wednesday October 31, 23:59 hoursĪssignment 2: Parallel Minimum Spanning Tree Algorithm. The deadline for this assignment is Monday, October 8, 23:59 hours.Īssignment 1-B: Hellerman-Rarick. Note that for using this code a gcc version of 4.9.0 is required. For those of you who want to work on an apple (MAC OS) platform a new skeleton code is made available and can be found here. The skeleton code for this assignment can be found here. 60%: Open "book" final exam.Īssignment 1: Sparse LU Factorization. If you attend this course and have not received an email that your name was added to the mailing list, please send an email with subject:PPI to assignments: programming assignments. The course lecturesĪre completed with programming assignments and/or (theoretical) algorithmic problems.Ī mailing list for this course was created. What is Parallelism taking a single problem, breaking it into lots of smaller problems, assigning those smaller problems to a number of processing cores. ExistingĪnd new (parallel) programming paradigms will be discussed. Numerical computing, parallel graph computing and parallel sorting. The course presents an introduction to parallel programming and parallel architectures and subsequently the study of parallel algorithm design, parallel High-performance computing (HPC) uses supercomputers and computer clusters to solve advanced computation problems. Banner image shows DAS-4 nodes at Leiden University (adapted from photo by Vianney Govers) Parallel Programming I, Fall 2018 ![]()
0 Comments
Leave a Reply. |