LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

HC 22

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

FIRST SEMESTER – APRIL 2007

CS 1807 – PARALLEL PROCESSING & ALGORITHMS

 

 

 

Date & Time: 30/04/2007 / 1:00 – 4:00      Dept. No.                                       Max. : 100 Marks

 

 

PART-A

10*2=20

Answer all

1. Define implicit parallelism?
2. List the various factors of network performance?
3. Define the degree of parallelism?
4. Write the important characteristics of parallel algorithms?
5. Describe the concept of resource conflicts?
6. What is clock skewing?
7. Describe about multiprogramming?
8. Define subscript separability?
9. Write an algorithm for O(n log n)work list ranking?
10. Define selection?

PART-B                    

5*8=40

Answer all

11. a) Describe about the shared memory multiprocessor?

(or)

1. b) Explain about the VLSI complexity model?
2. a) Explain the various standard performance measures?

(or)

1. b) Explain the gustafson’s law for a scaled speedup model?
2. a) Describe about the various mechanisms for instruction pipelining?

(or)

1. b) List the difference between CISC and RISC processors?
2. a) Explain the various categories of language features for parallel programs ?

(or)

1. b) Describe the local and global optimizations?
2. a) Write an algorithm for odd-even merge sort with example?

(or)

1. b) Explain the computational model with respective example?

 

PART-C

2*20=40

Answer any two

16. a) Explain PRAM model?
17. b) Describe about the static connection network?
18. a) Explain the virtual memory technology model?
19. b) Brief about the various categories of dependence test?
20. a) Write the preparata’s algorithm runs in O(log n) time and uses n log n CREW PRAM processors?
21. b) Explain the linear pipeline processor?

 

 

Go To Main page

 

Go To Main page