7.2. Preventing Deadlock
In Section 6.5.3, we found that deadlock can arise when concurrent transactions are competing for database resources. Deadlock is an embarrassment. Candidates may spend time enrolling online, making enrolment choices, only to find that their interaction with another candidate has caused a deadlock, forcing their transaction to fail. Deadlock is less embarrassing when an event merely produces a report, because the transaction can be restarted from the top without the user even knowing — provided it doesn’t fail repeatedly and cause significant delay.
7.2.1. Resource Priorities
Is it possible to avoid deadlock completely?
Yes it is — provided one is willing to accept the penalty. Depending on the system, the penalty may be ...
Get Systems Analysis and Synthesis now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
