Hyperlink-induced topic search algorithm lock analysis

A computing device, comprising:

• at least one processor;
• and
• memory including instructions that, when executed by the at least one processor, cause the computing device to:
• execute for a predetermined time interval and record data related to the execution of the computing device into a log;
• analyze the data recorded into the log to identify blocking relationships between processes executing on the computing device, wherein blocking relationships comprise lock contention information related to a first process being blocked by a second process due to the first process being unable to acquire a lock on an object because the second process is holding the lock on the object;
• plot the data into a graph data structure comprising:
• a plurality of nodes, each node representing one of the processes executing on the computing device;
• and
• links between the nodes that indicate the blocking relationships between the processes;
• set a predetermined initial criminal score for each node;
• set a predetermined initial victim score for each node;
• and
• iteratively update the criminal score and the victim score of each node, wherein the criminal score is updated based on the victim scores of the nodes that the node blocks and the victim score is updated based on the criminal scores of the nodes that block the node.

A non-transitory computer readable storage medium comprising one or more sequences of instructions, the instructions when executed by one or more processors causing the one or more processors to execute the operations of:

• executing a computing device for a predetermined time interval and recording data related to the execution of the computing device into a log;
• analyzing the data recorded into the log to identify blocking relationships between processes executing on the computing device, wherein blocking relationships comprise lock contention information related to a first process being blocked by a second process due to the first process being unable to acquire a lock on an object because the second process is holding the lock on the object;
• plotting the data into a graph data structure comprising:
• a plurality of nodes, each node representing one of the processes executing on the computing device;
• and
• links between the nodes that indicate the blocking relationships between the processes;
• setting a predetermined initial criminal score for each node;
• setting a predetermined initial victim score for each node;
• and
• iteratively updating the criminal score and the victim score of each node, wherein the criminal score is updated based on the victim scores of the nodes that the node blocks and the victim score is updated based on the criminal scores of the nodes that block the node.