Answer Happy

Task Performance Concurrency and Deadlocks Objective(s): At the end of the exercise, the students should be able to Assess the common concurrency mechanisms; and • Analyze the deadlock prevention and avoidance strategies as well as the detection approach Instructions: Analyze the illustrations below. Then, answer the following items. Search for related literature and/or relative studies that would support your answers. Cite your references accordingly. (55 points) Progress f Required GetA Deck Required Pando wa Get B Progres P Get A Get # Release A Rekte B -Boh PunQ want recome A -Bethand want resource B Required B Borut -Deadlock inevitable region - Psable serie path of Punto Horizontal portion of poth indicates Piscing and is waiting Vertical parts of puth indicates Recting and I waiting 1. Describe the deadlock scenario illustrated above based on your understanding (5 points) 2. What do you think would happen if both Process P and Q need to get the same resource? (5 points) 3. Which concurrency mechanism would you suggest that might prevent the deadlock situation above? Rationalize your answer. (5 points) 4. Define in detail the Execution Paths 2 to 6. (5 items x 3 points) Example: Execution Path 1 - Process Q acquires Resource B and then Resource A. Process Q then releases Resource B and A, respectively. 5. Do Execution Paths 3 and 4 encompass the first three conditions for a deadlock to occur? Explain your answer. (5 points)

7. Which deadlock avoidance approach would you suggest for the given situation above and why? (5 points) 8. Would you agree that deadlock is relative to the number of processes and available resources in an operating systern? Why or why not? (5 points) 9. If you are asked to reconstruct the progress diagram above to eliminate the critical section, which is the deadlock inevitable region, which aspect(s) or area(s) would you modify? Explain how the modification eliminates the deadlock. (5 points)