Raymonds tree based algorithm ensures
(A) no starvation, but deadlock may occur in rare cases
(B) no deadlock, but starvation may occur
(C) neither deadlock nor starvation can occur
(D) deadlock may occur in cases where the process is already starved
Answer: (B)
Explanation: Raymond’s tree based algorithm is lock based algorithm for mutual exclusion in a distributed system in which a site is allowed to enter the critical section if it has the token.
Option (B) is correct.
Quiz of this Question
Like Article
Suggest improvement
Share your thoughts in the comments
Please Login to comment...