graph based deadlock detection ------------------------------- Key: ISPN-144 URL: https://issues.jboss.org/browse/ISPN-144 Project: Infinispan Issue Type: Feature Request Reporter: Mircea Markus Assignee: Mircea Markus current deadlock detection impl only knows to look for deadlocks between two transactions: i.e. tx1 (k1,k2) tx (k2,k1). This might be enhanced with transitive deadlock detection check: tx1(k1,k2) tx2(k2,k3) tx3(k3,k1). In the previous example, if all transactions are done acquiring first lock we result in a deadlock. Needs further thinking.