PARALLEL COMPUTING

B.Tech.: Branch Name: CSE        Subject: Parallel Computing

a.    What do you mean by parallel sorting algorithm?

b.   Discuss enumeration sorting algorithm.

c.    Explain Parallel quick sorting algorithm.

d.   Describe parallel matrix multiplication algorithm.

e.   Illustrate UMA Multiprocessor to solve linear equations.

f.     Explain First Depth and Breadth First Search algorithm for graph.

g.    Solve for Bitonic sort for the series C N M F H A P D. also write algorithm.

h.   Sort the elements using Hyper Quick Sort: 11 50 53 95 36 44 67 86 1 16 35 81 5 15 23 44 15 46 48 93 39 6 72 91 14 36 69 40 89 61 97 12 21 54 (32 elements).

i.       Develop the algorithm for implementation of the Shell sort.     

j.     What is Granularity? Explain effect of granularity on parallel processing.

k.    Write algorithm for Odd-Even problem also solve A, C, B, E, D, H, F, G using Odd-Even.

l.      What is speedup? Differentiate Ideal speedup v/s True speedup.

m. Compare shared memory v/s Dynamic memory programming model.

n.   Differentiate ideal speedup v/s true speedup.

o.   What is the essence of the parallel generalization of the basic sorting operation?

                                                                      

Parallel Computing (TCS-081) Unit 1 Important Questions Uttarakhand Technical University  

PA in nut shell

Parallel algorithm Important Questions Unit III and IV