Check that Request $$ Available $($that is$,(1,0,2)(3,3,2)$ true

Allocation Need Available

A B C A B C A B C

T$0010743230(3,3,2)$

T$1302(200)020(122)$

T$2302600$

T$3211011$

T$4002431$

$$ Executing safety algorithm shows that sequence $<$ T$1,$ T$3,$ T$4,$ T$0,$ T$2>$ satisfies safety requirement

$$ Can request for $(3,3,0)$ by T$4$ be granted?

$$ Can request for $(0,2,0)$ by T$0$ be granted?

$11/2/2024$ CSCE $5640$: Deadlocks Solberschatz, Galvin and Gagne $201831$