Computing node job assignment using multiple schedulers
US10474497B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | May 8, 2019 |
| Grant date | Nov 12, 2019 |
| Priority date | — |
| Expiry date | May 8, 2039 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F2209/502
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.