SELECT THE CORRECT ANSWERS FROM THE DROPDOWNS: Oxidation occ…
SELECT THE CORRECT ANSWERS FROM THE DROPDOWNS: Oxidation occurs when an atom or molecule [drop1] electrons. Reduction occurs when an atom or molecule [drop2] electrons. The statement “These types of reactions readily occur independently of one another” is [drop3].
Read DetailsPotpourri_2a Potpourri 2. [8 points] Answer the following…
Potpourri_2a Potpourri 2. [8 points] Answer the following questions with reference to Xen’s I/O ring data structure. The I/O ring is a circular buffer used by Guest Operating systems for enqueuing requests for the Hypervisor, and collecting its responses. a. [2 points] You wish to improve I/O ring design by providing APIs in the guest OS to throttle the request creation. Assume the Guest OS needs just the number of outstanding requests to decide if it should throttle the requests. Is it possible to get this number of outstanding requests in the current implementation? Why or why not?
Read DetailsParallel_Systems_3b M.E.Lock The context for this question i…
Parallel_Systems_3b M.E.Lock The context for this question is the same as the previous question: [4 points] The Linux kernel historically used a ticket spin lock on multiprocessor systems. In 2016, Linux patch introduced a “qspinlock”, which is a “hybrid” design drawing inspiration from queue-based locks (MCS) and the old ticket lock. “qspinlock” is built based on a linked-list lock. However, the first spinner (next-in-line thread) spins on a lock bit instead of carrying a node structure from lock to unlock. When more contenting thread arrives, the first spinner pays the overhead to revert back to spin on the node structure and queues additional threads in a linked list. b. [2 point] Describe a scenario when either a ticket lock or a pure queue-based lock may outperform qspinlock. Explain why.
Read Details