# US 2016/0253369 A1 · Graphical lock analysis

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2016/0253369 A1
- Document ID: US20160253369A1
- Status: Published application
- Kind: A1
- Application number: 14/634,415
- Filed: 2015-02-27
- Published: 2016-09-01
- Earliest claimed: 2015-02-27
- Assignees: VMware, Inc.
- Applicants: VMware, Inc.
- Inventors: Jiaojiao Song; Zhelong Pan; Inna Rytsareva
- Web page: https://patentgrep.com/patent/US20160253369A1

## CPC

- G06F 11/3409: {for performance assessment}
- G06F 11/323: {Visualisation of programs or trace data}
- G06F 11/3476: {Data logging (G06F11/14, G06F11/2205 take precedence)}
- G06F 17/40: Data acquisition and logging (for input to computer G06F3/00)
- G06F 2201/865: Monitoring of software
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A system is described for identifying key lock contention issues in computing devices. A computing device is executed and lock contention information relating to operations during execution of the computing device is recorded. The data is parsed and analyzed to determine blocking relationships between operations due to lock contention. Algorithms are implemented to analyze dependencies between operations based on the data and to identify key areas of optimization for performance improvement. Algorithms can be based on the Hyperlink-Induced Topic Search algorithm or the PageRank algorithm.

## Claims

### Claim 1

A method comprising:
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; and
displaying a visual representation of the graph.

### Claim 2 (depends on 1)

The method of claim 1, wherein the process executing on the computing device comprises at least one of a thread of execution, an operation, an operation type, or a code line.

### Claim 3 (depends on 1)

The method of claim 1, wherein the visual representation of the graph indicates, with respect to each node in the graph, at least one of:
a number of nodes that the node blocks; or
a number of nodes that block the node.

### Claim 4 (depends on 1)

The method of claim 1, wherein the visual representation of the graph illustrates each node with a shape, wherein the size of the shape relates to at least one of:
a number of nodes that the node blocks; or
a number of nodes that block the node.

### Claim 5 (depends on 1)

The method of claim 1, wherein the visual representation of the graph illustrates each node with a shape, wherein the color of the shape relates to at least one of:
a number of nodes that the node blocks; or
a number of nodes that block the node.

### Claim 6 (depends on 1)

The method of claim 1, wherein the visual representation of the graph illustrates each of the links between the nodes, where one of the nodes blocks another one of the nodes, with at least one of:
a line connecting the blocked node with the blocking node;
an arrow pointing from the blocked node to the blocking node; or
an arrow pointing to the blocked node from the blocking node.

### Claim 7 (depends on 6)

The method of claim 6, wherein the visual representation of the graph illustrating each of the links between the nodes indicates at least one of:
a frequency of blocking between the nodes during the time interval; or
a blocking time between the nodes during the time interval.

### Claim 8

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; and
display a visual representation of the graph.

### Claim 9 (depends on 8)

The computing device of claim 8, wherein the process executing on the computing device comprises at least one of a thread of execution, an operation, an operation type, or a code line.

### Claim 10 (depends on 8)

The computing device of claim 8, wherein the visual representation of the graph indicates, with respect to each node in the graph, at least one of:
a number of nodes that the node blocks; or
a number of nodes that block the node.

### Claim 11 (depends on 8)

The computing device of claim 8, wherein the visual representation of the graph illustrates each node with a shape, wherein the size of the shape relates to at least one of:
a number of nodes that the node blocks; or
a number of nodes that block the node.

### Claim 12 (depends on 8)

The computing device of claim 8, wherein the visual representation of the graph illustrates each node with a shape, wherein the color of the shape relates to at least one of:
a number of nodes that the node blocks; or
a number of nodes that block the node.

### Claim 13 (depends on 8)

The computing device of claim 8, wherein the visual representation of the graph illustrates each of the links between the nodes, where one of the nodes blocks another one of the nodes, with at least one of:
a line connecting the blocked node with the blocking node;
an arrow pointing from the blocked node to the blocking node; or
an arrow pointing to the blocked node from the blocking node.

### Claim 14 (depends on 13)

The computing device of claim 13, wherein the visual representation of the graph illustrating each of the links between the nodes indicates at least one of:
a frequency of blocking between the nodes during the time interval; or
a blocking time between the nodes during the time interval.

### Claim 15

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; and
displaying a visual representation of the graph.

### Claim 16 (depends on 15)

The non-transitory computer readable storage medium of claim 15, wherein the visual representation of the graph indicates, with respect to each node in the graph, at least one of:
a number of nodes that the node blocks; or
a number of nodes that block the node.

### Claim 17 (depends on 15)

The non-transitory computer readable storage medium of claim 15, wherein the visual representation of the graph illustrates each node with a shape, wherein the size of the shape relates to at least one of:
a number of nodes that the node blocks; or
a number of nodes that block the node.

### Claim 18 (depends on 15)

The non-transitory computer readable storage medium of claim 15, wherein the visual representation of the graph illustrates each node with a shape, wherein the color of the shape relates to at least one of:
a number of nodes that the node blocks; or
a number of nodes that block the node.

### Claim 19 (depends on 15)

The non-transitory computer readable storage medium of claim 15, wherein the visual representation of the graph illustrates each of the links between the nodes, where one of the nodes blocks another one of the nodes, with at least one of:
a line connecting the blocked node with the blocking node;
an arrow pointing from the blocked node to the blocking node; or
an arrow pointing to the blocked node from the blocking node.

### Claim 20 (depends on 19)

The non-transitory computer readable storage medium of claim 19, wherein the visual representation of the graph illustrating each of the links between the nodes indicates at least one of:
a frequency of blocking between the nodes during the time interval; or
a blocking time between the nodes during the time interval.
