MU Computer Engineering (Semester 8)
Parallel & Distributed Systems
December 2016
Total marks: --
Total time: --
INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary


1(a) Explain with example Amdahl's law for measuring speed up performance of parallel systems.
5 M
1(b) Define various pipeline performance measures.
5 M
1(c) State the goals of distributed system.
5 M
1(d) State the desirable features of global scheduling algorithm
5 M

2(a) Write a note on Pipeline Hazards.
10 M
2(b) Explain in brief any three classification of parallel Architecture.
10 M

3(a) Write a note on Election algorithm.
10 M
3(b) Explain the concept of Remote Procedure Call.
10 M

4(a) Give one example that can be solved effectively with an SMD architecture.
10 M
4(b) Explain in brief the software concept of distributed systems.
10 M

5(a) Explain the need of client centric consistency models as compared to data centric consistency model. Explain any two client centric consistency model.
10 M
5(b) Explain Load balancing approach in distributed system.
10 M

Write a short note any two Q6.(i,ii,iii)
6(i) Andrew file system(AFS).
10 M
6(ii) Raymond'sTree based algorithm.
10 M
6(iii) Code Migration
10 M



More question papers from Parallel & Distributed Systems
SPONSORED ADVERTISEMENTS