Scribd
Upload
27 views2 pages

Elective - III: Parallel Computing: B.E. (Computer Technology) Eighth Semester (C.B.S.)

This document is an exam for the elective course Parallel Computing. It contains 12 questions to choose from, with each question having multiple parts. The questions cover various topics in parallel computing including abstract models of parallel computers, multiprocessor architectures, pipelining, data dependency analysis, shared memory programming, parallel algorithms like reduction and sorting, parallel programming languages, message passing, debugging parallel programs, dataflow computing, and concepts like distributed shared memory and Amdahl's law. Students must choose questions and solve them within the allotted time of three hours.

Uploaded by

Ayush Petkar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
27 views2 pages

Elective - III: Parallel Computing: B.E. (Computer Technology) Eighth Semester (C.B.S.)

This document is an exam for the elective course Parallel Computing. It contains 12 questions to choose from, with each question having multiple parts. The questions cover various topics in parallel computing including abstract models of parallel computers, multiprocessor architectures, pipelining, data dependency analysis, shared memory programming, parallel algorithms like reduction and sorting, parallel programming languages, message passing, debugging parallel programs, dataflow computing, and concepts like distributed shared memory and Amdahl's law. Students must choose questions and solve them within the allotted time of three hours.

Uploaded by

Ayush Petkar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

B.E. (Computer Technology) Eighth Semester (C.B.S.

)
Elective - III : Parallel Computing

P. Pages : 2 TKN/KS/16/7684
Time : Three Hours *0725* Max. Marks : 80
_____________________________________________________________________
Notes : 1. All questions carry marks as indicated.
2. Solve Question 1 OR Questions No. 2.
3. Solve Question 3 OR Questions No. 4.
4. Solve Question 5 OR Questions No. 6.
5. Solve Question 7 OR Questions No. 8.
6. Solve Question 9 OR Questions No. 10.
7. Solve Question 11 OR Questions No. 12.
8. Due credit will be given to neatness and adequate dimensions.
9. Assume suitable data whenever necessary.
10. Diagrams and chemical equations should be given whenever necessary.
11. Illustrate your answers whenever necessary with the help of neat sketches.
12. Use of non programmable calculator is permitted.

1. a) Explain Abstract model of parallel computer and also explain about P-RAM with the help 7
of suitable diagram.

b) Explain the multiprocessor Architecture in detail and also explain each desirable 6
characteristics of multiprocessors.
OR
2. a) Write the basics of pipelining. Explain the classification of pipeline processors. 7

b) Explain the Array processor by the help of suitable diagram. 6

3. a) Define Data Dependency Analysis. what are the various types of Dependencies required 8
to check at the time of Data Dependency Analysis, explain each type with proper
example.

b) Define and explain program Transformations with examples. 6


OR
4. a) Write the General model of shared memory programming and also explain it's two 7
important constraints.

b) How process creation, process Destruction and shared memory allocation done under 7
unix?

5. a) What is Parallel Reduction? How Analysis of parallel reduction is performed? 7

b) Write short note on Histrogram Computation. 6


OR
6. a) How matrix multiplication done in Parallel? Explain matrix multiplication on Loosely 7
coupled and tightly coupled multiprocessor.

b) Explain different types of parallel sorting Algorithms. 6

TKN/KS/16/7684 1 P.T.O
7. a) Write the Language features of Fortran go, which are help full for parallel computation. 7

b) Write short note on nCUBEC and Occam. 6


OR
8. a) Explain message-passing programming in detail. 7

b) Write about C-Linda with proper example. 6

9. a) What is Debugging? Explain Debugging in Message passing parallel programs by the help 8
of space time diagram.

b) Explain Debugging in shared memory parallel programs. 5


OR
10. a) Explain in detail circuit satisfiability problem. 7

b) Write short note on virtual memory system. 6

11. a) Define Data Flow Computing. What are the different types of Data flow graphs? Explain 8
the general model of a dynamic data flow machine.

b) Write short note on systolic Architectures. 6


OR
12. a) Write short note on any three. 14

a) Distributed shared memory.

b) Amdahl's law.

c) Karp-Flatt metric.

d) Gustafson-Barsis's Law.

***********

TKN/KS/16/7684 2

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy