Distributed File Systems xFS caches index nodes at managers…
Distributed File Systems xFS caches index nodes at managers but explicitly does not cache them at clients. a) [1 point] If index nodes were cached at clients, what performance benefit would clients gain? Be specific about which network messages would be eliminated.
Read DetailsSpring OS The context for this question is the same as the p…
Spring OS The context for this question is the same as the previous question. You are a software engineer on a team that maintains an important application that runs on Spring OS. Currently, Client Domain A, Client Domain B, Server Domain Y and Server Domain Z all run on a single node. Assume Server Z exports Object Z and Server Y exports Object Y. Recently, the entire application has been running slow. To improve system performance and scalability, your manager has proposed partitioning the domains across two nodes connected by a LAN. Proposed Split: Node 1: Client Domain A, Server Domain Z Node 2: Client Domain B, Server Domain Y b) [3 Points] Object Y supports both read and write operations. Client A must have read/write access to Y, while Client B must have read only access to Y. Using succinct bullets, state how the Spring mechanisms (capabilities, access control, doors) allow achieving the desired objectives.
Read DetailsRPC Latency Limits The context for this question is the same…
RPC Latency Limits The context for this question is the same as the previous question. Some client process C is making an RPC call to server process S. The amount of time for this RPC call to execute, t, can be represented as an expression of the following variables: tc – the time to copy n bytestx – the time to context switch between process P and P’tn – the time to transmit n bytes over the networkts – the time for procedure P to execute on S b) [2 points] Additionally, the kernel guarantees that any context switches occur after any data is transmitted. Provide an updated expression for t. Explain your reasoning.
Read DetailsDistributed Shared Memory The context for this question is t…
Distributed Shared Memory The context for this question is the same as the previous question. Consider the following sequence of actions in a TreadMarks DSM system. Assume pristine copies of pages X and Y are at their owner node O throughout. Assume X and Y are initially not present on any other node. T1: Processor P1:acq(L1)write Xrel(L1)T2: Processor P2:acq(L1)write Yrel(L1)T3: Processor P3:acq(L2)write Xrel(L2)T4: Processor P4:acq(L1)read Xwrite Yrel(L1) c) [2 points] What happens when P4 releases L1?
Read DetailsLamport’s Logical Clock The context for this question is the…
Lamport’s Logical Clock The context for this question is the same as the previous question. In the questions below, DB-A, DB-B, and DB-C represent a replicated database. For all questions in this section, explain your reasoning in one or two sentences. Correct justification is required to receive full credit. c) [3 points] Assume the replicated database stores a single key x. Write W1 updates x = 1 Write W2 updates x = 2 A read is called globally consistent if, at the time it is served, all replicas would return the same value of x. Now suppose we add a new event Rc, on DB-C, where Rc is a client read of x, and it occurs after c3 but before c4. Will the read at Rc be globally consistent? State yes or no and explain your reasoning in one or two sentences.
Read Details