Global Memory Systems The context for this question is the…
Global Memory Systems The context for this question is the same as the previous question. [5 points] Consider a GMS system with 10 Nodes ‘A’ to ‘J’. A process ‘x’ on Node ‘A’ intends to read-share a page that is currently actively used only by a process ‘y’ on Node ‘B’.When Node A’s GMS mechanism initiates the access, indicate on which Node(s) each of the following data structures are accessed.Assume no co-location constraints for any of the data structures c) [1 point] PFD
Read DetailsSpring OS [3 points] Your company has two teams developing S…
Spring OS [3 points] Your company has two teams developing Spring services that must interoperate. One team is implementing their service in C, while the other team is using C++. What artifacts must each team produce, so that these services, written in different languages, can communicate seamlessly within the Spring system? Briefly explain how these artifacts will be generated?
Read DetailsGlobal Memory Systems The context for this question is the s…
Global Memory Systems The context for this question is the same as the previous question. [5 points] Consider a 4 Node GMS system (A, B, C, D). Node A needs to evict pages P1 (age=15) and P2 (age=28). In the current epoch, the parameters are as follows: {“minAge”:25, “”:{“A”:0.2, ”B”:0.3, ”C”:0.1, ”D”:0.4}} b) [1 point] If a page has to be sent to a peer node, which is the Node most likely to receive it and why?
Read DetailsPotpourri The context for this question is the same as the p…
Potpourri The context for this question is the same as the previous question. [6 points] Your team is experimenting with different RPC communication methods for designing a distributed system. Two design choices are being considered- Design A involves LRPC-style mechanism where the client and server communicate through shared memory in an SMP. Design B involves traditional RPC where the client and server communicate across the LAN as discussed in the Thekkath & Levy paper. c) [1 point] How can you reduce the number of context switches in Design A even further?
Read DetailsPotpourri [4 points] (Answer True/False with justification –…
Potpourri [4 points] (Answer True/False with justification – No credit without justification) a) [2 points] In active networks, if the code requested by a node is not present in the previous active node specified in the “prev” field in the capsule header, the request is recursively sent to all the previous active nodes until the code is obtained.
Read DetailsGlobal Memory Systems The context for this question is the…
Global Memory Systems The context for this question is the same as the previous question. [5 points] Consider a GMS system with 10 Nodes ‘A’ to ‘J’. A process ‘x’ on Node ‘A’ intends to read-share a page that is currently actively used only by a process ‘y’ on Node ‘B’.When Node A’s GMS mechanism initiates the access, indicate on which Node(s) each of the following data structures are accessed.Assume no co-location constraints for any of the data structures e) [1 point] Now, suppose a new process ‘z’ spawns on Node ‘A’ with the intention to read-share the same page. Which Node’s PFD shall be accessed this time?
Read Details