Performance Analysis of Victim Selection Algorithms in Distributed Systems and Proposal of Weight Based Resolution Strategy

Deadlocks affect the performance of all systems that support concurrent execution of transactions. Presence of deadlocks is usually detected by checking for cycles in Wait-For graph. Once deadlocks are detected, the cycle can be broken by aborting one of the transactions (Victim). Main objective of victim selection is avoiding starvation. This paper analyses the performance of various victim selection algorithms given in the literature to find out how optimal they are with respect to other desirable parameters of a system like throughput, fairness, resource utilization and resolution latency apart from starvation. This paper also proposes weight based resolution algorithm to dynamically select least cost victim.