We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
(ti (Pages : 2) 6866
Eighth Semester B.Tech. Degree Examination, November 2013
(2008 Scheme)
08.804 : DISTRIBUTED SYSTEMS (R)
Time : 3 Hours lax. Marks : 100
1. What is meant by middlewave ? What is its role in a distributed computing
environment ?
2. Whatis the difference between fail-stop and crash failure ?
3. What is clock drift rate ? Explain clock drift in the context of synchronous and
asynchronous distributed systems.
4. List different methods for defeating security threats in distributed systems.
5. Explain the terms (i) socket and (ii) ports in the context of interprocess
communication.
6. Describe the request reply message structure in client server communication.
7. Differentiate between remote and local method invocations.
8. Whatis a persistent object in the context of RMI ?
9. What is the role of virtual file system in NFS.
0. Explain lost update problem. (10x4=40 Marks)
P.T.O.6866
PART-B
Answer one question from each Module. Each question carries 20 marks.
11.
12.
15.
16.
Module -1
a) What are the challenges associated with distributed system design ?
b) Explain the model that simplifies and abstracts the functions of individual
components of a distributed system.
OR
a) Describe and illustrate the client server architecture of three major internet
applications.
b) Can firewall prevent denial of service attacks ? What are the other methods
available to deal with such attacks ?
Module — II
. a) Explain how external data representation and marshalling is done in CORBA.
b) Why is there no explicit data typing in CORBA CDR ?
c) How can we create a new process in a distributed system ?
OR
. a) Explain how traditional object model can be extended to distributed systems.
b) Explain how an event-based distributed system works with suitable examples.
Module - Ill
a) Describe the architecture of Andrew File System (AFS) emphasizing the
distribution of processes in the file system.
b) Explain how optimistic concurrency control schemes work.
OR
a) Explain how transaction serialization is done using locks.
b) Illustrate different techniques for replicating transactions.
10
10
10
10
10
10
10
10
10