Module wise Question Bank Sub: Parallel Computing Branch: M.E COMPUTER ENGINEERING University of Mumbai Module 1 ……………………………………………………………. Expected Examination Questions Discuss in detail classification parallel computers? Explain different factors affecting decision of parallelism? What are the levels of parallel processing ? Write a note on Applications of parallel computing ? What is pipelining ? Discuss in detail principles of designing pipeline processor. What are the factors affecting the performance of pipeline computers? For pipeline processor system explain i) Instruction pre fetching ii) Data dependency hazards Explain causes , detection ,avoidance and resolution of pipeline hazards? Module 2 ……………………………………………………………….. Expected Examination Questions: Explain in detail UMA & NUMA architectures ? Explain SIMD interconnection networks? What are the types of SIMD array processors? Discuss different features of Systolic arrays ? What are the types of systolic arrays ? Explain variations in designing Systolic arrays ? What are the typical structures of systolic architectures ? Prof. Sharvari Govilkar , PIIT, New panvel Page 1 What are the advantages of systolic architectures ? Discuss applications of systolic arrays . Write a note on: 1) Cluster computing 2) Grid Computing . Module 3 ……………………………………………………………… Expected Examination Questions What is parallel algorithm ? Explain the design process of Parallel Algorithms. Discuss different attributes of parallel algorithms? Explain different parallel algorithm models . What is the need for decomposition? List & explain various decomposition Techniques with examples. Describe the Characteristics of tasks & interaction which can be used in the process of mapping . What are the types of tasks & inter-task interaction? Define : 1) Task dependency Graph 2) Task Interaction Graph 3) Critical Path Module 4 …………………………………………………………………… Expected Examination Questions Explain row wise 1-D & 2-D partitioning parallel algorithm for Matrix-Vector Multiplication. What is Cannon’s algorithm for Matrix multiplication? Discuss performance analysis of cannon’s algorithm. What is DNS algorithm for Matrix multiplication? Discuss performance analysis of DNS algorithm. What are the issues in sorting on parallel computers ? Explain parallel bubble sort algorithm . Compare it with sequential one. Explain parallel Quick sort algorithm. Prof. Sharvari Govilkar , PIIT, New panvel Page 2 Derive the final minimum spanning tree for the given graph .use prim’s parallel algorithm for the same . What is parallel reduction ? Give analysis of parallel reduction algorithm. Module 5 ………………………………………………………………….. Expected Examination Questions What is message passing programming ? Explain in detail blocking & Nonblocking message passing operations? Write a note on Message Passing Interface( MPI). (expected points in ans : MPI Library, communications, Send-receive information & example ) Explain general model of shared memory programming . Give architecture of PVM? Define following w.r.t to PVM : 1) Host 2) Virtual Machine 3) Task 4) TID 5) pvmd 6) message 7) Group Explain the programming model of PVM. Describe different characteristics of Threads How to create & Join the thread . Give example. Discuss shared memory programming model for UNIX OS w.r.t a) Process Creation b) Process Destruction c) Shared memory Allocation d) Synchronization primitives. Module 6 ………………………………………………………… • Expected Examination Questions • Discuss different performance metrics for parallel systems . • Explain different sources of overheads associated with parallel programs ? • What is the effect of granularity on performance of parallel programs . Prof. Sharvari Govilkar , PIIT, New panvel Page 3 • Give Asymptotic analysis of Parallel programs . Module 7 ……………………………………………………………….. Expected Examination Questions Write a short note on 1) High performance JAVA 2) High performance FORTRAN 3) OpenMp. …………………………… ALL THE BEST …………………………………………………… Prof. Sharvari Govilkar , PIIT, New panvel Page 4