504 views
0 votes
0 votes
Consider the following graph-based locking protocol that allows only exclusive lock modes, and that operates on data graphs that are in the form of a rooted directed acyclic graph.
$•$ A transaction can lock any vertex first.
$•$ To lock any other vertex, the transaction must have visited all the parents of that vertex, and must be holding a lock on one of the parents of the vertex.
Show that the protocol ensures serializability and deadlock freedom.

Please log in or register to answer this question.

Related questions