Distributed Systems
This document was uploaded by user and they confirmed that they have the permission to share it. If you are author or own the copyright of this book, please report to us by using this DMCA report form. Report DMCA
Overview
Download & View Distributed Systems as PDF for free.
More details
- Words: 191
- Pages: 1
678 B. E. 8th Semester (Information Tech.) Examination, December-2006 DISTRIBUTED SYSTEMS Paper-IT-402-C Time allowed: 3 hours Maximum marks: 100
Note: Attempt any jive questions. 1.
Discuss the process management in MACH operating system completely.
2.
20
(a) What happens if a Munin process modifies a shared variable outside a critical region ?
10
(b) Briefly discuss how shared objects are managed in Orca? 10 3.
Discuss the following in context of distributed file, system (i) Naming transparency (ii) Semantics for file sharing (iii) 1\\'0 level naming.
4.
Discuss any two measures that can be taken for fault tolerance in distributed systems.
5.
20
Discuss the following algorithms for achieving mutual exclusion in distributed,systems. (i) Centralized algorithm (ii) Token Ring algorithm
6.
(a) How can atomic broadcast be used to manage group membership in a communicating group?
10
(b) What do you mean by dynamic binding? How it ~an be used to match client and server? 7.
10
What do you mean by a deadlock? How deadlocks are prevented and detected in distributed systems ?
8.
20
Briefly discuss the following: (i) Atomic Transactions (ii) Directory service in DeE.
678-p-2-Q-8 (06)
10+10
Note: Attempt any jive questions. 1.
Discuss the process management in MACH operating system completely.
2.
20
(a) What happens if a Munin process modifies a shared variable outside a critical region ?
10
(b) Briefly discuss how shared objects are managed in Orca? 10 3.
Discuss the following in context of distributed file, system (i) Naming transparency (ii) Semantics for file sharing (iii) 1\\'0 level naming.
4.
Discuss any two measures that can be taken for fault tolerance in distributed systems.
5.
20
Discuss the following algorithms for achieving mutual exclusion in distributed,systems. (i) Centralized algorithm (ii) Token Ring algorithm
6.
(a) How can atomic broadcast be used to manage group membership in a communicating group?
10
(b) What do you mean by dynamic binding? How it ~an be used to match client and server? 7.
10
What do you mean by a deadlock? How deadlocks are prevented and detected in distributed systems ?
8.
20
Briefly discuss the following: (i) Atomic Transactions (ii) Directory service in DeE.
678-p-2-Q-8 (06)
10+10
Related Documents
Distributed Systems
November 2019 32
Distributed Document-based Systems
May 2020 22
Distributed File Systems
May 2020 19
Distributed Systems - System Models
July 2020 24
Livro - Distributed Systems - Tanenbaum.pdf
November 2019 20