1

Introduction to Parallel Programming. Instructor: Prof. Yogish Sabharwal, Department of Computer Science and Engineering, IIT Delhi

FREE
This course includes
Hours of videos

666 years, 7 months

Units & Quizzes

37

Unlimited Lifetime access
Access on mobile app
Certificate of Completion

This course focuses on the shared memory programming paradigm. It covers concepts and programming principles involved in developing scalable parallel applications. Assignments focus on writing scalable programs for multi-core architectures using OpenMP and C. This is an introductory course in shared memory parallel programming suitable for computer science as well as non-computer science students working on parallel/HPC applications and interested in parallel programming. (from nptel.ac.in)

Course Currilcum

  • 00:00:00
  • 00:00:00
  • 00:00:00
  • 00:00:00
  • 00:00:00
  • 00:00:00
  • 00:00:00
  • 00:00:00
  • 00:00:00
  • 00:00:00
  • 00:00:00
  • 00:00:00
  • 00:00:00
  • Lecture 14 – Context Switching Unlimited
  • Lecture 15 – OpenMP: Basic Thread Functions Unlimited
  • Lecture 16 – OpenMP: About OpenMP Unlimited
  • Lecture 17 – Shared Memory Consistency Models and the Sequential Consistency Model Unlimited
  • Lecture 18 – Race Conditions Unlimited
  • Lecture 19 – OpenMP: Scoping Variables and Some Race Conditions Unlimited
  • Lecture 20 – OpenMP: Thread Private Variables and More Constructs Unlimited
  • Lecture 21 – Computing Sum: First Attempt at Parallelization Unlimited
  • Lecture 22 – Manual Distribution of Work and Critical Sections Unlimited
  • Lecture 23 – Distributing for Loops and Reduction Unlimited
  • Lecture 24 – Vector-Vector Operations (Dot Product) Unlimited
  • Lecture 25 – Matrix-Vector Operations (Matrix-Vector Multiply) Unlimited
  • Lecture 26 – Matrix-Matrix Operations (Matrix-Matrix Multiply) Unlimited
  • Lecture 27 – Introduction to Tasks Unlimited
  • Lecture 28 – Task Queues and Task Execution Unlimited
  • Lecture 29 – Accessing Variables in Tasks Unlimited
  • Lecture 30 – Completion of Tasks and Scoping Variables in Tasks Unlimited
  • Lecture 31 – Recursive Task Spawning and Pitfalls Unlimited
  • Lecture 32 – Understanding LU Factorization Unlimited
  • Lecture 33 – Parallel LU Factorization Unlimited
  • Lecture 34 – Locks Unlimited
  • Lecture 35 – Advanced Task Handling Unlimited
  • Lecture 36 – Matrix Multiplication using Tasks Unlimited
  • Lecture 37 – The OpenMP Shared Memory Consistency Model Unlimited