Blog

The nurse is completing a safety check in the room of a patient who active suicidal intents. Which of the following items must be removed for the patient’s safety? Select all that apply. (3 answers are correct)

Match the level of anxiety to the appropriate description:

“Any evidence of the use of a math solver or AI tool will be considered academic dishonesty and will result in a grade of zero. Students may have the opportunity to reinstate their grade by providing a clear and detailed explanation of the problem-solving process.”   Please respond stating that you have read and understand this information.

Potpourri_6a Potpourri 6. I/O ring data structures can be used to facilitate data transfer between paravirtualized guest OSs and the hypervisor. Consider a guest OS making a hypercall to the hypervisor to write some data to disk. The process begins with the guest making the write request, followed by the hypervisor processing the request and responding. Finally, the guest consumes this response.          a. [2 points] What information is conveyed by the guest OS via the I/O ring data structure when making the write request?

Potpourri_1 Potpourri 1. [2 points] (Answer True/False with justification)  “SPIN and Exokernel are fair in comparing the superiority of their respective specialization approaches for OS services relative to Mach micro-kernel.” 

Potpourri_6b Potpourri The context for this question is the same as the previous question. 6. I/O ring data structures can be used to facilitate data transfer between paravirtualized guest OSs and the hypervisor. Consider a guest OS making a hypercall to the hypervisor to write some data to disk. The process begins with the guest making the write request, followed by the hypervisor processing the request and responding. Finally, the guest consumes this response.      b. [4 points] Access to the ring data structure is through several pointers. For the disk write, describe in order the sequence of pointer modifications from request production to response consumption. Assume that there is space in the I/O ring for the Guest OS to enqueue a new request. For each modification, state: who makes the modification (guest or hypervisor).  which pointer is modified.  what the pointer modification is. 

Parallel_Systems_8b LRPC The context for this question is the same as the previous question. 8. Consider a single processor machine running a client and server. The client calls a procedure ‘foo’ on the server with the following declaration:   void foo(data_structure a, data_structure b);     The server always expects the actual parameters of the call to be in its stack.     Consider the following variables representing average times to complete the described operations.  T1: Average time to copy a variable of type ‘data_structure’ from user space to kernel space and vice versa.  T2: Average time to copy a variable of type ‘data_structure’ from user space to user space.  T3: Average time the server takes to execute the procedure ‘foo’.  T4: Average time to switch between user-space domains (averaged over thread-doctored and normal thread-scheduled workflows).  T5: Average time for a kernel trap and associated validation (averaged over binding object and non-binding object workflows).     Answer the questions below based on the information and average times given above. You should give an explanation of the component times that make up your answer to get any credit. Consider any other time that is not mentioned above as negligible.    b. [3 points] Calculate the total client wait time after calling the procedure ‘foo’, if the server and client were two different processes, and the OS does not optimize the RPC workflow for processes running on the same machine. 

Potpourri_2 Potpourri 2.  [2 points] (Answer True/False with justification)  In a fully virtualized environment, the hypervisor uses the Physical Page Number (PPN) generated by the Guest Operating system to index into the Shadow Page Table and map it to the corresponding Machine Physical Number (MPN).

Parallel_Systems_4c M.E.Lock The context for this question is the same as the previous question. 4. Consider the following lock algorithm: while ((L == locked) or (T&S(L) == locked)) {    while (L == locked); // spin    delay (d[Pi]); // different delays for different processors  }  // success if we are here    c. [2 points] What are the program characteristics that would enhance the program’s performance with this lock algorithm implementation? In what way does it improve performance?

Parallel_Systems_5b M.E.Lock The context for this question is the same as the previous question. 5. Consider the ticket lock algorithm from lecture 4 (slide 108): b. [1.5 points] What are the downsides of the ticket lock algorithm for systems with write-update cache coherence? Briefly explain your answer.