Is distributed locking harder?

Paris C. Kanellakis, Christos H. Papadimitriou
1984 Journal of computer and system sciences (Print)  
The problem of determining whether a set of locked transactions, accessing a distributed database, is guaranteed to produce only serializable schedules is examined. For a pair of transactions, with n steps, it is proved that this concurrency control problem, which is polynomially solvable for centralized databases, is in general coNP-complete. A new graphtheoretic technique is employed and an G(n') test for the special case of databases distributed between two sites is provided.
doi:10.1016/0022-0000(84)90078-3 fatcat:i7ybv3xvmfe35mf5fr6cp23egi