Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
2 views

Guidelines_IntroductionToParallelProgramming

The document outlines the guidelines for the B.Sc. (H) Computer Science VI Semester course on Introduction to Parallel Programming (DSC18), detailing the units covered and suggested lecture hours for each unit. It includes references for textbooks and additional resources, as well as a suggested practical list of programming tasks to be implemented in parallel using OpenMP. The course focuses on parallel computing concepts, OpenMP programming, MPI programming, and applications of parallel programming.

Uploaded by

Ambarish Gahlod
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Guidelines_IntroductionToParallelProgramming

The document outlines the guidelines for the B.Sc. (H) Computer Science VI Semester course on Introduction to Parallel Programming (DSC18), detailing the units covered and suggested lecture hours for each unit. It includes references for textbooks and additional resources, as well as a suggested practical list of programming tasks to be implemented in parallel using OpenMP. The course focuses on parallel computing concepts, OpenMP programming, MPI programming, and applications of parallel programming.

Uploaded by

Ambarish Gahlod
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Guidelines of B.Sc.

(H) Computer Science VI Semester (NEP UGCF 2022)


Introduction to Parallel Programming
DSC18

Sno. Unit covered Guidelines Suggested


No. of
Lectures
1 Unit I: Chapter 1: 1.1, 1.2 [1] 10
Introduction to Parallel Computing Chapter 2: 2.1, 2.2, 2.3, 2.4.1 [1]
2 Unit II: Chapter 7: 7.1,7.2 and 7.10 (without 15
OpenMP programming for shared p-thread implementations) [1]
memory systems Chapter 17 [2]
Lecture 17, 27-31 [4]
3 Unit III: Chapter 2: 2.4.3 (completely- 10
MPI programming for distributed connected network, linear arrays,
memory systems meshes only) [1]

Chapter 6: 6.1 - 6.3, 6.5 (except


Cannon Matrix Multiplication), 6.6
(till and including 6.6.9) [1]

4 Unit IV: Chapter 6: 6.3.5, 6.6.9, 8.2 (till and 10


Applications including 8.2.1) [1]
Complete [3]
Lecture 34 [4]

References:
1. Grama, A., Gupta, A., Karypis, G., Kumar, V.,(2003) Introduction to Parallel
Computing, 2nd edition, 2003, Addison-Wesley.
2. Quinn, M.,(2017) Parallel Programming in C with MPI and OpenMP, 1st Edition,
McGraw-Hill.
3. Revdikar, L., Mittal, A., Sharma, A., Gupta, S., A Naïve Breadth First Search Approach
Incorporating Parallel Processing Technique For Optimal Network Traversal,
International Journal of Advanced Research in Computer and Communication
Engineering Vol. 5, Issue 5, May 2016
4. https://sites.google.com/view/yogishsabharwal/moocs?authuser=0

Additional Resources:

1. https://onlinecourses.nptel.ac.in/noc22_cs21/preview
Suggested Practical List for the Introduction to Parallel Programming Paper (DSC18)

1. Implement matrix-matrix multiplication in parallel using OpenMP


2. Implement distributed histogram sorting in parallel using OpenMP
3. Implement breadth first search in parallel using OpenMP
4. Implement Dijkstra’s algorithm in parallel using OpenMP

You might also like