Deadlock-freedom (and safety) of transactions in a distributed database

摘要

We analyze the problem of determining freedom from deadlock of transactions which control concurrency by locking in a distributed database. We use a graph-theoretic formalization of the problem and show that it is NP-hard even for two transactions. The problem of determining safety (serializability of all schedules) and deadlock freedom is also examined. We show that this problem can be solved in polynomial time for any fixed number of transactions.