Scribd
Upload
49 views1 page

Distributed Systems Assignment 2

The document outlines an assignment on distributed systems, focusing on clock synchronization using the Berkeley algorithm among four computers. It includes questions on the suitability of transactions in distributed computations, default DNS name server addresses, end-to-end security in emailing systems, and the positioning of middleware in distributed systems. The assignment is worth 25 marks and consists of multiple parts requiring explanation and diagrammatic representation.

Uploaded by

Clint Mukarakate
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
49 views1 page

Distributed Systems Assignment 2

The document outlines an assignment on distributed systems, focusing on clock synchronization using the Berkeley algorithm among four computers. It includes questions on the suitability of transactions in distributed computations, default DNS name server addresses, end-to-end security in emailing systems, and the positioning of middleware in distributed systems. The assignment is worth 25 marks and consists of multiple parts requiring explanation and diagrammatic representation.

Uploaded by

Clint Mukarakate
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Distributed Systems: Assignment 2(25 marks)

1. Consider a network consisting of 4 computers: A (coordinator), B, C, and D. At 14:


35 the coordinator decides to synchronize the clock of all computers in the network.
At that moment, the clock of every computer in the network shows the following.

Computer Clock

A 14:35

B 14:37

C 14:39

D 14:24

Apply the Berkeley clock synchronisation algorithm to this situation, show the
stages of computation, and write what will be the outcome of the synchronisation.
Assume that the time needed for computation and for network communication is
negligible. [7]

2. A distributed computation may involve related operations on a number of objects


which reside at different nodes of a distributed system. Briefly explain why the
concept of transaction is suitable for modelling such a computation. [6]
3. Which name server addresses do DNS name servers hold by default, and why? [4]
4. Using an emailing system as an example, define what end-to-end security is. [4]
5. Use a diagram to show the positioning of the middleware in a distributed system. [4]

You might also like