Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Progress of o Rekase A Pand Q wan A Required Release Get A Deadlock inevitable Pand O want B Required Get Progres ofP Get A GetB Relase A Release Hoth Pand Q wat reurce A - Both Pand Q want resure B Reguired B Required - Deadlock inevitable megion - Possible progress path of Pand Q. Horizontal pantion of path indicutes Pis esecuting and Qis waiting. Vertical portion of path indicates Q is executing and Pis waiting. 1. Describe the deadiock 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)

Progress of o Rekase A Pand Q wan A Required Release Get A Deadlock inevitable Pand O want B Required Get Progres ofP Get A GetB Relase A Release Hoth Pand Q wat reurce A - Both Pand Q want resure B Reguired B Required - Deadlock inevitable megion - Possible progress path of Pand Q. Horizontal pantion of path indicutes Pis esecuting and Qis waiting. Vertical portion of path indicates Q is executing and Pis waiting. 1. Describe the deadiock 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)

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
Progress of Q Release A Pand Q want A A Release Required Get A 3 Deadlock inevitable Pand Q want B B Required Get B 4 Progress of P Get Al Get B Release A Release B = Both Pand Q want resource A Both Pand Q want resource B A Required B Required - Deadlock-inevitable region - Possible progress palth of Pand Q Horizontal pontion of path indicates Pis executing nd Q is waiting. Vertical portion of path indicates Qis executing and Pis waiting. 1. Describe the deadlock scenario illustrated above based on your understanding. (5 points) 2. What do you think would happen if both Process Pand 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)
Transcribed Image Text:Progress of Q Release A Pand Q want A A Release Required Get A 3 Deadlock inevitable Pand Q want B B Required Get B 4 Progress of P Get Al Get B Release A Release B = Both Pand Q want resource A Both Pand Q want resource B A Required B Required - Deadlock-inevitable region - Possible progress palth of Pand Q Horizontal pontion of path indicates Pis executing nd Q is waiting. Vertical portion of path indicates Qis executing and Pis waiting. 1. Describe the deadlock scenario illustrated above based on your understanding. (5 points) 2. What do you think would happen if both Process Pand 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)
6. If you are to implement deadlock prevention before the processes above reach the critical section, would it be an indirect method or an indirect method? Why? (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 system? 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)
Transcribed Image Text:6. If you are to implement deadlock prevention before the processes above reach the critical section, would it be an indirect method or an indirect method? Why? (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 system? 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)
Expert Solution
steps

Step by step

Solved in 3 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS