Quiz-2: Ref: DISTRIBUTED SYSTEMS: Concepts and Design, Fifth Edition, CDK

5.6
Describe the ways in which the request-reply protocol masks the heterogeneity of
operating systems and of computer networks.

5.22
A client makes remote method invocations to a server. The client takes 5 milliseconds to
compute the arguments for each request, and the server takes 10 milliseconds to process
each request. The local operating system processing time for each send or receive
operation is 0.5 milliseconds, and the network time to transmit each request or reply
message is 3 milliseconds.
Marshalling or unmarshalling takes 0.5 milliseconds per message.
Calculate the time taken by the client to generate and return from two requests:
(i) if it is single-threaded;
(ii) if it has two threads that can make requests concurrently on a single
processor.
You can ignore context-switching times. Is there a need for asynchronous invocation if
the client and server processes are threaded?

9.16
Compare RPC call semantics with the semantics of WS-ReliableMessaging:
i. State the entities to which each refers.
ii. Compare the differing meanings of the available semantics (for example,
atleast-once, at-most-once, exactly-once).
Chapter 5 and page 392

12.8
Outline client module implementations for the UNIX open() and read() system calls, using
the NFS RPC calls of Figure 12.9, (i) without and (ii) with a client cache.
pages 538, 542

13.11
When might a DNS server provide multiple answers to a single name lookup, and why?
page 581

14.15
The figure above shows events occurring for each of two processes, p1 and p2. Arrows
between processes denote message transmission. Draw and label the lattice of consistent
states (p1 state, p2 state), beginning with the initial state (0,0). page 622