You are on page 1of 2

Tutorial-1

1.
2.
3.
4.
5.

What is parallel computing? Describe its scope.


What is the difference between parallel and distributed computing?
Describe the types of implicit parallelism.
Elaborate the physical organization of parallel platforms.
What are the routing mechanisms for interconnection networks?
Tutorial-2

1.
2.
3.
4.
5.

Describe one to all broadcast in array, ring and mesh networks.


Describe all to all broadcast in array, ring and hypercube networks.
Describe all to all personalized communication in array, ring and mesh networks.
What do you mean by reduction?
Discuss the term prefix sums.

Tutorial-3
1. What are the sources of overhead in parallel program? Explain.
2. Provide the performance of parallel system in following terms
A. Execution time
B. Total parallel overhead
C. Speedup
D. Efficiency
E. Cost
3. What is the effect of granularity on performance in parallel systems?
4. Define different message passing programming tools in detail.
5. Why performance extrapolation is difficult in scalable parallel computers.

Tutorial-4
1. Explain the merge sort algorithm in parallel environment. Perform merge sort on the
following array

2.
3.
4.
5.

25
30
3
45
12
What is the effect of granularity on performance in parallel systems?
What do you mean by sorting networks? Describe with example.
Discuss the parallel version of the bubble sort algorithm.
Elaborate the working of quick sort algorithm.
Tutorial-5

1.
2.
3.
4.
5.
6.

Determine the longest common sequence of <A,B,C,D,B,A,C,D> and <C,B,A,F>.


What are the other sorting algorithms that can be parallelized? How?
Describe the dynamic programming algorithm in parallel systems.
How to parallelize the shortest path problem.
Provide the algorithm for 0/1 knapsack problem in detail in parallel environment.
Explain the travelling salesman problem in detail and determine its complexity.

You might also like