Factor Completely.  If the polynomial can not be factored, state prime.  

“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.

Parallel_Systems_9a Parallel System Scheduling 9. Consider a multi-threaded multicore CPU is one which each chip has multiple cores, and each core has multiple hardware threads.  The OS chooses the set of application threads to be scheduled on the hardware threads in each core.  Given that the hardware threads share a single processor pipeline on the core,    a. [2 points] What purpose is served by the hardware threads?   

Parallel_Systems_3 Shared Memory Machines 3. [2 points] Consider a shared address space architecture.  The address space is divided into two partitions:  Partition A is NCC-NUMA  Partition B is CC-NUMA  What guarantees are needed from the architecture to ensure that it provides sequential consistency memory model to the programmer? 

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?

Parallel_Systems_8a LRPC 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.    a. [2 point] Calculate the total client wait time after calling the procedure ‘foo’, if the server and client were collocated in the same process. 

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. 

Solve the proportion for the given variable. Round the solution where indicated.

Parallel_Systems_7 LRPC 7. [2 points] (Answer True/ False with justification) The kernel holds two procedure descriptors associated with Server A; one for procedure ‘foo’ with total number of simultaneous calls set to 5 and the other for procedure ‘bar’ with total number of simultaneous calls set to 6. Given that these are the only 2 procedures registered by this server, the total number of simultaneous RPCs that the server can field is max(5, 6) = 6.

Parallel_Systems_5c 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): c. [1.5 points] What are the downsides of the ticket lock algorithm for systems with write-invalidate cache coherence? Briefly explain your answer.