1. A computer implemented system for efficiently resolving deadlocks between two computing threads in computer transaction processing, the system comprising: at least one processor and at least one computer-readable storage medium storing instructions executable by the at least one processor, a graph transformation component configured to create a strongly connected component (SCC) from a wait-for graph associated with deadlocks between two computing threads in computer transaction processes of a multiprocessor system; and the strongly connected component formed by reducing the wait-for-graph; a victim node selection component configured to: identify a deadlock cycle; resolve deadlock cycles between two computing threads in computer transaction processes of the multiprocessor system via the strongly connected component by executing a greedy algorithm: until no additional nodes can be removed, iteratively select a victim node based on a combination of priority of the node and removal cost of the node based on an amount of log used by an associated task, and based on assuming that the selected node is removed from the strongly connected component, estimate an associated total cost defined as the removal cost of the selected node and remaining nodes of the strong connected component, wherein in each iteration, a single optimal node is selected for removal based on estimated remaining cost and priority; remove the selected victim node and remaining nodes based on the estimated total cost and resolve the deadlocks.