Interesting Deadlock Graph with one lock
-
Generally the deadlock graphs involve 2 locks where each spid owns one and wants the other. In the attached image there's only one lock in question. Also, SPID 56 is a simple select statement with no transactions running. Both SPIDS are running READ COMMITTED. I'm not sure how this can cause a deadlock. Can anyone explain?
-
Amazingly enough I just read a series of blog posts by Bart Duncan that addresses this situation. Here is a link to the first post in the series as you may need background from each post to understand the next post:
http://blogs.msdn.com/bartd/archive/2006/09/09/Deadlock-Troubleshooting_2C00_-Part-1.aspx
Jack Corbett
Consultant - Straight Path Solutions
Check out these links on how to get faster and more accurate answers:
Forum Etiquette: How to post data/code on a forum to get the best help
Need an Answer? Actually, No ... You Need a Question -
Thanks for the link. It does explain what's going on in this case - however the deadlock graph is not showing the 2nd lock in question. Maybe it's a limitation of the deadlock graph?
-
Could be. You should look at the direct XML representation of the graph.
Jack Corbett
Consultant - Straight Path Solutions
Check out these links on how to get faster and more accurate answers:
Forum Etiquette: How to post data/code on a forum to get the best help
Need an Answer? Actually, No ... You Need a Question
Viewing 4 posts - 1 through 3 (of 3 total)
You must be logged in to reply to this topic. Login to reply