1
Parallel Computing. Instructor: Prof. Subodh Kumar, Department of Computer Science and Engineering, IIT Delhi.
FREE
This course includes
Hours of videos
944 years, 4 months
Units & Quizzes
34
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
This is a first course in parallel programming and does not require any previous parallel computing experience. Data structures and Operating Systems are required. With the growing number of cores on a chip, programming them efficiently has become an indispensable knowledge for the future. Modern Parallel Programming is a hands-on course involving significant parallel programming on compute-clusters, multi-core CPUs and massive-core GPUs. (from nptel.ac.in)
Course Currilcum
- Lecture 01 – Introduction Unlimited
- Lecture 02 – Parallel Programming Paradigms Unlimited
- Lecture 03 – Parallel Architecture Unlimited
- Lecture 04 – Parallel Architecture (Case Studies) Unlimited
- Lecture 05 – OpenMP Unlimited
- Lecture 06 – OpenMP (cont.) Unlimited
- Lecture 07 – OpenMP (cont.) Unlimited
- Lecture 08 – OpenMP and PRAM Model of Computation Unlimited
- Lecture 09 – PRAM (Parallel Random-Access Machine) Unlimited
- Lecture 10 – Models of Parallel Computation, Complexity Unlimited
- Lecture 11 – Memory Consistency Unlimited
- Lecture 12 – Memory Consistency and Performance Issues Unlimited
- Lecture 13 – Parallel Program Design Unlimited
- Lecture 14 – Shared Memory and Message Passing Unlimited
- Lecture 15 – MPI (Message Passing Interface) Unlimited
- Lecture 16 – MPI (cont.) Unlimited
- Lecture 17 – MPI (cont.) Unlimited
- Lecture 18 – Algorithmic Techniques Unlimited
- Lecture 19 – Algorithmic Techniques (cont.) Unlimited
- Lecture 20 – Algorithmic Techniques (cont.) Unlimited
- Lecture 21 – CUDA Unlimited
- Lecture 22 – CUDA (cont.) Unlimited
- Lecture 23 – CUDA (cont.) Unlimited
- Lecture 24 – CUDA (cont.) Unlimited
- Lecture 25 – CUDA (cont.) Unlimited
- Lecture 26 – CUDA (cont.) Unlimited
- Lecture 27 – CUDA (cont.) Unlimited
- Lecture 28 – Algorithms, Merging and Sorting Unlimited
- Lecture 29 – Algorithms, Merging and Sorting (cont.) Unlimited
- Lecture 30 – Algorithms, Merging and Sorting (cont.) Unlimited
- Lecture 31 – Algorithms, Merging and Sorting (cont.) Unlimited
- Lecture 32 – Algorithms, Merging and Sorting (cont.) Unlimited
- Lecture 33 – Lower Bounds Lock Free Synchronization, Load Stealing Unlimited
- Lecture 34 – Lock Free Synchronization, Graph Algorithms Unlimited
