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

Code: CSP315 Concurrent and Parallel Programming Lab Credit: 02 L-T-P: (0-0-3) Course Content

This document provides information about the course CSP315 Concurrent and Parallel Programming Lab. The course has 2 credits and involves implementing synchronization primitives like semaphores and monitors through programming exercises. Students will also implement parallel algorithms using CUDA and OpenMP and solve classic concurrency problems like the Producer-Consumer problem, Reader-Writer problem, Sleeping Barber problem, and Dining Philosopher problem. The course will also involve using lex and yacc to design a mini-compiler. References include textbooks on concurrent programming.

Uploaded by

Aneesh Kaushal
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
55 views

Code: CSP315 Concurrent and Parallel Programming Lab Credit: 02 L-T-P: (0-0-3) Course Content

This document provides information about the course CSP315 Concurrent and Parallel Programming Lab. The course has 2 credits and involves implementing synchronization primitives like semaphores and monitors through programming exercises. Students will also implement parallel algorithms using CUDA and OpenMP and solve classic concurrency problems like the Producer-Consumer problem, Reader-Writer problem, Sleeping Barber problem, and Dining Philosopher problem. The course will also involve using lex and yacc to design a mini-compiler. References include textbooks on concurrent programming.

Uploaded by

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

Code: CSP315

Course Content

Important Text
Books/References

Concurrent and Parallel Programming Lab

Credit: 02

L-T-P:(0-0-3)
Programming exercises to implement synchronization primitives
semaphores and monitors. Parallel algorithm implementation
(CUDA and OpenMP)
Implementing solutions for Producer-Consumer problem infinite
buffer, bounded buffer; Reader Writer problem; Sleeping Barber
problem; Dining Philosopher problem
lex(flex), yacc(bison) for lexical and parsing
1. Design of a mini-compiler
Text/Reference books for course on Concurrent Programming

You might also like