# US 2026/0064461 A1 · Method, device, and computer program product for determining job conflicts

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

- Number: US 2026/0064461 A1
- Document ID: US20260064461A1
- Status: Published application
- Kind: A1
- Application number: 18/923,013
- Filed: 2024-10-22
- Published: 2026-03-05
- Earliest claimed: 2024-09-03
- Assignees: Dell Products L.P.
- Applicants: Dell Products L.P.
- Inventors: Xiaolei HU; Yudai WANG; Yuanzhuo YU; Zheyi ZHU; Jing YU
- Web page: https://patentgrep.com/patent/US20260064461A1

## CPC

- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Embodiments of the present disclosure relate to a method, a device, and a computer program product for determining job conflicts. The method includes determining, based on a job type of a target job, a target vertex corresponding to the target job in a dynamic graph. The method also includes generating, based on conflict strategies identified by a static graph, a target edge associated with the target vertex in the dynamic graph. In addition, the method also includes determining, in response to the target edge already existing in the dynamic graph, that a conflict exists between the target job and a running job.

## Claims

### Claim 1

A method for determining a job conflict, comprising:
determining, based on a job type of a target job, a target vertex corresponding to the target job in a dynamic graph, wherein the target job is associated with an operation in a data protection system, and the dynamic graph is generated based on a static graph identifying conflict strategies between different job types;
generating, based on the conflict strategies identified by the static graph, a target edge associated with the target vertex in the dynamic graph, wherein an edge in the dynamic graph corresponds to a running job in the data protection system; and
determining, in response to the target edge already existing in the dynamic graph, that a conflict exists between the target job and the running job.

### Claim 2 (depends on 1)

The method according to claim 1, wherein generating the target edge associated with the target vertex in the dynamic graph comprises:
obtaining from the static graph a static edge with a starting point being the target vertex, wherein the static edge indicates a conflict strategy related to a job attribute of the target job; and
generating, based on the static edge and the job attribute of the target job, in the dynamic graph the target edge corresponding to the static edge, and the target edge having the same edge attribute as the job attribute.

### Claim 3 (depends on 2)

The method according to claim 2, wherein the job attribute comprises at least one of a host used for executing the target job and an asset related to the target job.

### Claim 4 (depends on 3)

The method according to claim 3, wherein determining in the dynamic graph the target vertex corresponding to the target job comprises:
determining a target vertex corresponding to the job type utilizing a vertex hash table, wherein a key in the vertex hash table is a job type, and a value in the vertex hash table is a vertex in the dynamic graph.

### Claim 5 (depends on 3)

The method according to claim 3, wherein determining that a conflict exists between the target job and the running job comprises:
determining whether the target edge is in an edge hash table corresponding to the dynamic graph based on the starting point, end point, and edge attribute of the target edge, wherein the edge hash table stores all edges in the dynamic graph; and
determining, in response to the target edge existing in the edge hash table, that a conflict exists between the target job and the running job.

### Claim 6 (depends on 5)

The method according to claim 5, further comprising:
determining, in response to the target edge not existing in the edge hash table, that no conflict exists between the target job and the running job;
scheduling the target job in the data protection system; and
adding the target edge to the dynamic graph.

### Claim 7 (depends on 6)

The method according to claim 6, further comprising:
removing, in response to the target job being accomplished, the target edge from the dynamic graph.

### Claim 8 (depends on 1)

The method according to claim 1, further comprising:
abandoning, in response to a conflict existing between the target job and the running job, execution of the target job.

### Claim 9 (depends on 1)

The method according to claim 1, further comprising:
collecting training data for training a graph neural network from a plurality of data protection systems, wherein the training data comprises a snapshot of a dynamic graph and information on a failed job; and
training the graph neural network based on the training data.

### Claim 10 (depends on 9)

The method according to claim 9, further comprising:
generating, based on the trained graph neural network, an updated edge in the static graph, the updated edge indicating an updated conflict strategy associated with the information on the failed job; and
adding, in response to the updated conflict strategy being valid, the updated edge to the static graph.

### Claim 11

An electronic device, comprising:
a processor; and
a memory coupled to the processor and having instructions stored therein that, when executed by the processor, cause the processor to perform following actions:
determining, based on a job type of a target job, a target vertex corresponding to the target job in a dynamic graph, wherein the target job is associated with an operation in a data protection system, and the dynamic graph is generated based on a static graph identifying conflict strategies between different job types;
generating, based on the conflict strategies identified by the static graph, a target edge associated with the target vertex in the dynamic graph, wherein an edge in the dynamic graph corresponds to a running job in the data protection system; and
determining, in response to the target edge already existing in the dynamic graph, that a conflict exists between the target job and the running job.

### Claim 12 (depends on 11)

The electronic device according to claim 11, wherein generating the target edge associated with the target vertex in the dynamic graph comprises:
obtaining from the static graph a static edge with a starting point being the target vertex, wherein the static edge indicates a conflict strategy related to a job attribute of the target job; and
generating, based on the static edge and the job attribute of the target job, in the dynamic graph the target edge corresponding to the static edge, and the target edge having the same edge attribute as the job attribute.

### Claim 13 (depends on 12)

The electronic device according to claim 12, wherein the job attribute comprises at least one of a host used for executing the target job and an asset related to the target job.

### Claim 14 (depends on 13)

The electronic device according to claim 13, wherein determining in the dynamic graph the target vertex corresponding to the target job comprises:
determining a target vertex corresponding to the job type utilizing a vertex hash table, wherein a key in the vertex hash table is a job type, and a value in the vertex hash table is a vertex in the dynamic graph.

### Claim 15 (depends on 13)

The electronic device according to claim 13, wherein determining that a conflict exists between the target job and the running job comprises:
determining whether the target edge is in an edge hash table corresponding to the dynamic graph based on the starting point, end point, and edge attribute of the target edge, wherein the edge hash table stores all edges in the dynamic graph; and
determining, in response to the target edge existing in the edge hash table, that a conflict exists between the target job and the running job.

### Claim 16 (depends on 15)

The electronic device according to claim 15, wherein the actions further comprise:
determining, in response to the target edge not existing in the edge hash table, that no conflict exists between the target job and the running job;
scheduling the target job in the data protection system; and
adding the target edge to the dynamic graph.

### Claim 17 (depends on 16)

The electronic device according to claim 16, wherein the actions further comprise:
removing, in response to the target job being accomplished, the target edge from the dynamic graph.

### Claim 18 (depends on 11)

The electronic device according to claim 11, wherein the actions further comprise:
abandoning, in response to a conflict existing between the target job and the running job, execution of the target job.

### Claim 19 (depends on 11)

The electronic device according to claim 11, wherein the actions further comprise:
collecting training data for training a graph neural network from a plurality of data protection systems, wherein the training data comprises a snapshot of a dynamic graph and information on a failed job; and
training the graph neural network based on the training data.

### Claim 20

A non-transitory computer-readable medium comprising machine-executable instructions that, when executed, cause a machine, cause the machine to perform following actions:
determining, based on a job type of a target job, a target vertex corresponding to the target job in a dynamic graph, wherein the target job is associated with an operation in a data protection system, and the dynamic graph is generated based on a static graph identifying conflict strategies between different job types;
generating, based on the conflict strategies identified by the static graph, a target edge associated with the target vertex in the dynamic graph, wherein an edge in the dynamic graph corresponds to a running job in the data protection system; and
determining, in response to the target edge already existing in the dynamic graph, that a conflict exists between the target job and the running job.
