How do you identify and handle deadlocks in concurrent programming.

Question

Anonymous · Accepted Answer

So, deadlocks can be resolved by 2 methods: optimistic locking and pessimistic
locking. The optimistic locking let's the multiple users to book the same thing
at the same time but each of them will carry a version with them which user
books first the version gets updated in the database and then it provides the
another user as it's already taken. So, this is used in almost all cases of the
booking system. So the system can handle itself. So, about the pessimistic
locking it holds the seats for 1 user and locks for around 2 mins let's say and
that doesn't allow another user to book that seat. So by this method it takes
bit more time but it's safe and easy to have it without any synchronous issues.

How do you identify and handle deadlocks in concurrent programming.

Practice this question with AI

Go Premium

Community Answers

Unlock Full Access

Practice More Questions