[理工] [OS] deadlock
two processes, A and B, each need three records, 1, 2, and 3, in a batabase.
if A asks for them in the order 1, 2, 3, and B asks for them in the same order
deadlock is not possible
however, if B asks for them in the order 3, 2, 1, then deadlock is possible
with three resources, there are 3! or six possible combinations each process
can request the resources
what fraction of all the combinations is guaranteed to be deadlock free?
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.228.24.84
討論串 (同標題文章)