# US 2021/0334135 A1 · Computing node job assignment using multiple schedulers

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

- Number: US 2021/0334135 A1
- Document ID: US20210334135A1
- Status: Published application
- Kind: A1
- Application number: 17/305,461
- Filed: 2021-07-08
- Published: 2021-10-28
- Earliest claimed: 2018-11-14
- Assignees: Capital One Services, LLC
- Applicants: Capital One Services, LLC
- Inventors: Gopi KANCHARLA; Sanjiv YAJNIK; Raman BAJAJ; James LAND; Susmitha GANGARAPU; Praveen TANDRA; Parvesh KUMAR; Janardhan PRABHAKARA
- Web page: https://patentgrep.com/patent/US20210334135A1

## CPC

- G06F 9/4875: {with migration policy, e.g. auction, contract negotiation}
- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- G06F 9/5027: {the resource being a machine, e.g. CPUs, Servers, Terminals}
- G06F 9/542: {Event management; Broadcasting; Multicasting; Notifications}
- G06F 9/546: {Message passing systems or structures, e.g. queues}
- G06F 2209/502: Proximity
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A set of computing nodes may receive a corresponding set of heartbeat messages that originated at the set of computing nodes. The set of heartbeat messages may relate to selecting, among the set of computing nodes, a leader computing node to process a set of jobs. State information included in the heartbeat messages may be provided to a leader election algorithm that outputs information indicating one or more computing nodes that are most qualified to process the set of jobs based on processing capabilities of the computing nodes and processing constraints associated with the set of jobs. The computing node may select itself as the leader computing node to process the set of jobs based on determining, from the information output by the leader election algorithm, that the computing node is most qualified to process the set of jobs and no other computing nodes are processing the set of jobs.

## Claims

### Claim 1

A device, comprising:
one or more memories; and
one or more processors, coupled to the one or more memories, configured to:
receive a set of heartbeat messages that originated from a set of devices that include the device,
wherein the set of heartbeat messages is associated with selecting a leader device, among the set of devices, to process a set of jobs;
determine, based on the set of heartbeat messages, a set of scores representing how qualified devices of the set of devices are to process the set of jobs based on processing capabilities of corresponding devices, of the set of devices, and a set of processing constraints associated with the set of jobs;
identify, based on determining the set of scores, the device as the leader device,
wherein the leader device is identified based on determining that the set of jobs is not being processed by any other device of the set of devices; and
process the set of jobs by the device.

### Claim 2 (depends on 1)

The device of claim 1, wherein identifying the device as the leader device is based on whether a unique identifier associated with the device corresponds to the unique identifier in a heartbeat message, of the set of heartbeat messages, associated with the highest score of the set of scores.

### Claim 3 (depends on 1)

The device of claim 1, wherein a heartbeat message of the set of heartbeat messages includes at least one of:
a unique identifier of a respective device of the set of devices,
information identifying a quantity of jobs being processed by the respective device,
information associated with a status of jobs being processed by the respective device, or
information associated with processing capabilities of the respective device.

### Claim 4 (depends on 1)

The device of claim 1, wherein determining that the set of jobs is not being processed by any other device of the set of devices is based on information included in the set of heartbeat messages.

### Claim 5 (depends on 1)

The device of claim 1, wherein the set of devices are subscribed to a message stream associated with the set of heartbeat messages, and
wherein the set of devices publish respective heartbeat messages to the message stream.

### Claim 6 (depends on 1)

The device of claim 1, wherein one or more heartbeat messages, of the set of heartbeat messages, from different geographic regions, are received via a global message broker, and
wherein one or more local message brokers associated with the different geographic regions transmit the one or more heartbeat messages to the global message broker.

### Claim 7 (depends on 1)

The device of claim 1, wherein the one or more processors, to identify the device as the leader device, are configured to:
determine that the device and one or more other devices, of the set of devices, are tied for being identified as the leader device;
generate, based on information associated with the set of heartbeat messages, a hash to break the tie between the device and the one or more other devices; and
select, based on the hash, the device as the leader device.

### Claim 8

A method, comprising:
receiving, by a device, a set of heartbeat messages that originated from a set of devices that include the device,
wherein the set of heartbeat messages is associated with selecting a leader device, among the set of devices, to process a set of jobs;
determining, by the device and based on the set of heartbeat messages, a set of scores representing how qualified devices of the set of devices are to process the set of jobs based on processing capabilities of corresponding devices, of the set of devices, and a set of processing constraints associated with the set of jobs;
identifying, by the device and based on determining the set of scores, the device as the leader device,
wherein the leader device is identified based on determining that the set of jobs is not being processed by any other device of the set of devices; and
processing, by the device, the set of jobs.
determining, by the device, based on determining that the device is the most qualified to process the set of jobs, and based on determining that the set of jobs is not being processed by any other device of the set of devices, the device as the leader device to process the set of jobs; and
processing, by the device, the set of jobs.

### Claim 9 (depends on 8)

The method of claim 8, wherein identifying the device as the leader device is based on whether a unique identifier associated with the device corresponds to the unique identifier in a heartbeat message, of the set of heartbeat messages, associated with the highest score of the set of scores.

### Claim 10 (depends on 8)

The method of claim 8, wherein a heartbeat message of the set of heartbeat messages includes at least one of:
a unique identifier of a respective device of the set of devices,
information identifying a quantity of jobs being processed by the respective device,
information associated with a status of jobs being processed by the respective device, or
information associated with processing capabilities of the respective device.

### Claim 11 (depends on 8)

The method of claim 8, wherein determining that the set of jobs is not being processed by any other device of the set of devices is based on information included in the set of heartbeat messages.

### Claim 12 (depends on 8)

The method of claim 8, wherein the set of devices are subscribed to a message stream associated with the set of heartbeat messages, and
wherein the set of devices publish respective heartbeat messages to the message stream.

### Claim 13 (depends on 8)

The method of claim 8, wherein one or more heartbeat messages, of the set of heartbeat messages, from different geographic regions, are received via a global message broker, and
wherein one or more local message brokers associated with the different geographic regions transmit the one or more heartbeat messages to the global message broker.

### Claim 14 (depends on 8)

The method of claim 8, wherein identifying the device as the leader device comprises:
determining that the device and one or more other devices, of the set of devices, are tied for being identified as the leader device;
generating, based on information associated with the set of heartbeat messages, a hash to break the tie between the device and the one or more other devices; and
selecting, based on the hash, the device as the leader device.

### Claim 15

A non-transitory computer-readable medium storing a set of instructions, the set of instructions comprising:
one or more instructions that, when executed by one or more processors of a device, cause the device to:
receive a set of heartbeat messages that originated from a set of devices that include the device,
wherein the set of heartbeat messages is associated with selecting a leader device, among the set of devices, to process a set of jobs;
determine, based on the set of heartbeat messages, a set of scores representing how qualified devices of the set of devices are to process the set of jobs based on processing capabilities of corresponding devices, of the set of devices, and a set of processing constraints associated with the set of jobs;
identify, based on determining the set of scores, the device as the leader device,
wherein the leader device is identified based on determining that the set of jobs is not being processed by any other device of the set of devices; and
process the set of jobs by the device.

### Claim 16 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein identifying the device as the leader device is based on whether a unique identifier associated with the device corresponds to the unique identifier in a heartbeat message, of the set of heartbeat messages, associated with the highest score of the set of scores.

### Claim 17 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein a heartbeat message of the set of heartbeat messages includes at least one of:
a unique identifier of a respective device of the set of devices,
information identifying a quantity of jobs being processed by the respective device,
information associated with a status of jobs being processed by the respective device, or
information associated with processing capabilities of the respective device.

### Claim 18 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein determining that the set of jobs is not being processed by any other device of the set of devices is based on information included in the set of heartbeat messages.

### Claim 19 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the set of devices are subscribed to a message stream associated with the set of heartbeat messages, and
wherein the set of devices publish respective heartbeat messages to the message stream.

### Claim 20 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein one or more heartbeat messages, of the set of heartbeat messages, from different geographic regions, are received via a global message broker, and
wherein one or more local message brokers associated with the different geographic regions transmit the one or more heartbeat messages to the global message broker.
