Question Paper: Parallel And Distributed Systems Question Paper - May 16 - Computer Engineering (Semester 8) - Mumbai University (MU)
0

Parallel And Distributed Systems - May 16

Computer Engineering (Semester 8)

Total marks: 80
Total time: 3 Hours
INSTRUCTIONS
(1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.
(3) Draw neat diagrams wherever necessary.

Q.1

(a) Explain Data Flow computers with example.
(5 marks) 00

(b) What is the basic task of scheduler? Define i) Latency, ii) Initiation 5 Rate, iii) Stage Utilization and iv) Forbidden Latency.
(5 marks) 00

(c) What are the different models of middleware?
(5 marks) 00

(d) What are the issues in designing a distributed system?
(5 marks) 00

Q.2

(a) A machine is run on many applications and the instruction mix is 10 collected. Loads/Store are 10%, Integer addisub 15%, FP add/sub 50%, FP multiply divide 5% and others 5% and branches 15%. The clock cycles consumed by these instructions are: Loads 2. Integer add/ sub 1, FP add/sub 5, FP multiply divide 20, others l. Find which component of the architecture requires enhancement first. After incorporating the enhancement which makes clock cycles requirements as 2. Find the overall Speedup.
(10 marks) 00

(b) What is SIMD Architecture? Explain with example SIMD Mesh Connected Architecture.
(10 marks) 00

Q.3

(a) What is an interlock? Explain the following three different classes of hazards :
(10 marks) 00

(i) Control Hazards

(ii) Resource hazards

(iii) Operand hazards

(b) Explain a pipelined multiplication using Digit Products of Fixed Point Multiplication Pipeline.
(10 marks) 00

Q.4

(a) Explain the difference between Data Centric and Client Centric Consistency Models. Explain one model of each.
(10 marks) 00

(b) Explain stream oriented communication with suitable example.
(10 marks) 00

Q.5

(a) Explain the distributed algorithms for Mutual Exclusion? What are the advantages and disadvantages of it over centralized algorithms?
(10 marks) 00

(b) Write a Suzuki-Kasami's Broardcast Algorithm. Explain with example.
(10 marks) 00

Q.6

(a) Compare Load sharing to task assignment and Load balancing strategies for scheduling processes in a distributed system.
(10 marks) 00

(b) What are the desirable features of good distributed file systems? Explain file sharing semantic of it.
(10 marks) 00

ADD COMMENTlink
written 9 months ago by gravatar for tanya.tanyabarnwal tanya.tanyabarnwal0
Please log in to add an answer.