Understanding Deadlock and Resource Allocation in OS
School
Bryant University**We aren't endorsed by this school
Course
COM 243
Subject
Industrial Engineering
Date
Dec 12, 2024
Pages
2
Uploaded by ProfessorGoose4785
COMSC 420 Principles of Operating Systems Fall 2024 Homework #7 1.Read section 8.1 – 8.8 2.Discuss the deadlock mechanism for the OS of your choice. Update your PPT and upload it to the bridges. 3.Consider the following snapshot of a system: Allocation Request A B C D A B C D T0 1 2 0 2 4 3 1 6 T1 0 1 1 2 2 4 2 4 T2 1 2 4 0 3 6 5 1 T3 1 2 0 1 2 6 2 3 T4 1 0 0 1 3 1 1 2 Using the banker's algorithm, determine whether or not each of the following states is unsafe. If the state is safe, illustrate the order in which the threads may complete. Otherwise, illustrate why the state is unsafe. a.available = (3,0,1,4) b.available = (1,5,2,2) 4.Which of the six resource-allocation graphs shown below illustrate deadlock? For those situations that are deadlocked, provide the cycle of threads and resources. Where there is not a deadlock situation, illustrate the order in which the threads may complete execution.
5.Run the deadlock detection algorithm to check if the current system is deadlocked. Allocation Request MAX = <A B C D E> = <2 1 1 2 1> A B C D E A B C D E T0 1 0 1 1 0 0 1 0 0 1 T1 1 1 0 0 0 0 0 1 0 1 T2 0 0 0 1 0 0 0 0 0 1 T3 0 0 0 0 0 1 0 1 0 1