1. Differentiate the physical clock and logical clock.

Physical clock
 It is a physical process and also a method of measuring that process to
record the passage of time. For example, the rotation of the Earth
measured in solar days. Most of the physical clocks are based on cyclic
processes such as a celestial rotation.
Logical clock
 It is a mechanism for capturing causal and chronological relationships in a
distributed system. A physically synchronous global clock may not be
present in
a distributed system. In such systems a logical clock allows global ordering on
events from different processes.

2. What are the properties of Global states?

3. State the issues in clocks.

 The instantaneous difference between the readings of any two clocks is called
as Clock skew.
 Clock drift refers the time count at different rate, so the corresponding clocks
 may diverge.
 A clock’s drift rate is the change in the offset (difference in reading) between
the clock and a nominal perfect reference clock per unit of time measured by
the reference clock

4. Describe the characteristics of P2P system

 Each system share resources
 They may unique or duplicate
 Correct operation does not depends on any server
 Limited degree
 Algorithms for placing resources
5. Write Happened before relation.

6. Discuss on LDAP.
Lightweight Directory Access Protocol
 X.500’s assumption that organizations would provide information about
themselves in public directories within a common system has proved largely
unfounded.
 Equally, its compexity has meant that its uptake has been relatively modest.
 A group at the University of Michigan proposed a more lightweight approach
called the Lightweight Directory Access Protocol (LDAP), in which a DUA
accesses X.500 directory services directly over TCP/IP instead of the upper layers
of the ISO protocol stack.
 LDAP also simplifies the interface to X.500 in other ways: for example, it
provides a relatively simple API and it replaces ASN.1 encoding with textual
encoding.
 Although the LDAP specification is based on X.500, LDAP does not require it.
 An implementation may use any other directory server that obeys the simpler
 LDAP specification, as opposed to the X.500 specification.
 For example, Microsoft’s Active Directory Services provides an LDAP interface.
 Unlike X.500, LDAP has been widely adopted, particularly for intranet directory
services. It provides secure access to directory data through authentication.

7. What are the main task of Routing overlays

 Routing of requests to objects: A client wishing to invoke an operation on an object
submits a request including the object’s GUID to the routing overlay, which routes the
request to a node at which a replica of the object resides.
 Insertion of objects: A node wishing to make a new object available to a peer-to-peer
service computes a GUID for the object and announces it to the routing overlay, which
then ensures that the object is reachable by all other clients.
 Deletion of objects: When clients request the removal of objects from the service the
routing overlay must make them unavailable.
 Node addition and removal: Nodes (i.e., computers) may join and leave the service.
When a node joins the service, the routing overlay arranges for it to assume some of
the responsibilities of other nodes. When a node leaves (either voluntarily or as a result
of a system or network fault), its responsibilities are distributed amongst the other
nodes.
8. Define Global State.
A global state of the system is the state of the collection of processes.
9. Define Directory module, Client Module and Flat File service.
Flat file service
 The flat file service is concerned with implementing operations on the contents of files.
 Unique file identifiers (UFIDs) are used to refer to files in all requests for flat file
service operations.
 The responsibilities between the file service and the directory service are based upon
the use of UFIDs.
 UFIDs are long sequences of bits chosen so that each file has a UFID that is unique
among all of the files in a distributed system.
 When the flat file service receives a request to create a file, it generates a new UFID
 for it and returns the UFID to the requester.
Directory service
 Provides mapping between text names for the files and their UFIDs. Clients may
obtain the UFID of a file by quoting its text name to directory service. Directory
service supports functions needed generate directories, to add new files to directories.
Client module
 A client module runs in each client computer, integrating and extending the operations
of the flat file service and the directory service under a single application programming
interface that is available to user-level programs in client computers.
 The client module also holds information about the network locations of the flat file
server and directory server processes.

10. Define Vice and Venus

 Vice is the name given to the server software that runs as a user-level UNIX process in
each server computer, and
 Venus is a user-level process that runs in each client computer and corresponds to the
client module in our abstract model.
11. List the essential requirements for mutual exclusion.

12. Define namespace, aliases, name services and binding.

 A name is resolved when it is translated into data about the named resource or object,
often in order to invoke an action upon it. The association between a name and an
object is called a binding.
 Name Services

 A name service stores a collection of one or more naming contexts. Naming contexts:
sets of bindings between textual names and attributes for objects (such as users,
computers, services and remote objects).

Name Spaces
 It is a collection of all valid names recognized by a particular service. Names may have
an internal structure that represents their position in a hierarchic name space.
 Example: file systems (/etc/passwd is different from /oldetc/passwd).

 Aliases - An alias is a name defined to denote the same information as another name,
similar to a symbolic link between file path names.
 For example, using web redirection, http://bit.ly/ctqjvH refers to
http://cdk5.net/additional/rmi/programCode/ShapeListClient.java.

13. List the task of routing overlays.

 Routing of requests to objects: A client wishing to invoke an operation on an object
submits a request including the object’s GUID to the routing overlay, which routes the
request to a node at which a replica of the object resides.
 Insertion of objects: A node wishing to make a new object available to a peer-to-peer
service computes a GUID for the object and announces it to the routing overlay, which
 then ensures that the object is reachable by all other clients.
 Deletion of objects: When clients request the removal of objects from the service the
routing overlay must make them unavailable.
 Node addition and removal: Nodes (i.e., computers) may join and leave the service.
When a node joins the service, the routing overlay arranges for it to assume some of
the responsibilities of other nodes. When a node leaves (either voluntarily or as a result
of a system or network fault), its responsibilities are distributed amongst the other
nodes.
14. Define internal and external synchronization.

16. Define history and consistent cut.

17. What is meant by safety and liveness.
Safety and liveness.
There is an undesirable property - that is a predicate of the system’s global state.
Let be could be the property of being deadlocked.

18. Define navigation and its types.

 It is the process of locating naming data from among more than one name server in
order to resolve a name.
 There are three types of Navigation:
 Client – Controlled Iterative Navigation.
 Multicast Navigation
 Server Controlled Navigation

19. What is meant by callback promise?

 a callback promise – a token issued by the Vice server that is the custodian of the file,
guaranteeing that it will notify the Venus process when any other client modifies the
file.
 Callback promises are stored with the cached files on the workstation disks and have
 two states: valid or cancelled.

20. Define failure Detector. List its types.

 A failure detector is a service that processes queries about whether a particular process
has failed. It is often implemented by an object local to each process (on the same
computer) that runs a failure-detection algorithm in conjunction with its counterparts at
other processes. The object local to each process is called a local failure detector.
 There are two types of failure detectors:
o Unreliable failure detectors
o Reliable failure detectors

Part –B

1. File system Architecture, Napster

2. Andrew File System

3. Domain Name Service

4. Chandy Lamport Snapshot algorithm

5. Synchronization methods

6. Pastry