归纳法证个题,谁会?# Unix - 噫吁兮,危乎高哉
d*t
1 楼
N processes,{Pi: 1<= i <= N}
one share resource R
let all processes Pi require the use of R. I.e.,each process
performs a wait(R).
证明DEADLOCK不存在。
one share resource R
let all processes Pi require the use of R. I.e.,each process
performs a wait(R).
证明DEADLOCK不存在。