Question Paper: Parallel And Distributed Systems Question Paper - May 17 - Computer Engineering (Semester 8) - Mumbai University (MU)
Parallel And Distributed Systems - May 17
Computer Engineering (Semester 8)
Total marks: 80
Total time: 3 Hours
(1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.
(3) Draw neat diagrams wherever necessary.
What are the common issues with which the designer of a heterogeneous distributed system must deal?
State and prove Amdahl's Law to compute speedup of parallel computers. From experiment it was verified that 70% of execution time was spent on parallel execution. What is the maximum speedup that can be obtained with 16 processors?
Explain the concept of Processing Element in SIMD architecture.
Explain stream oriented communication with an example.
Discuss Raymond's Tree based algorithm of token based distributed mutual exclusion.
How pipeline hazards are classified? Discuss data hazard in detail and list the techniques used to eliminate data hazard.
Discuss and differentiate various client-centric consistency models.
Illustrate the parallel Algorithm for matrix multiplication and compare the performance of this algorithm with sequential matrix multiplication algorithim.
Describe code migration issues in detail.
What is a logic clock? Why are logic clocks required in distributed systems? How does Lamport
synchronize logical clocks? Which events are said to be concurrent in Lamport timestamps.
What is the requirement of Election algorithm in Distributed Systems? Describe any one Election algorithm in detail with an example.
Define a Remote Procedure Call. Explain the working of RPC in detail.
Describe File-Cashing schemes.
Differentiate between Job scheduling and load balancing. Discuss the issues in designing Load Balancing Algorithm.