High availability cluster management of computing nodes
US11061719B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Feb 6, 2019 |
| Grant date | Jul 13, 2021 |
| Priority date | — |
| Expiry date | May 8, 2039 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F2209/506
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Techniques and solutions are described for providing high-availability computing resources to service client requests. Groups of computing nodes are organized into loops, a given loop being configured to execute a particular subset of tasks, such as tasks with a hash value in a particular ranged serviced by a loop. Computing nodes within a loop can evaluate a task request to determine whether the task request conflicts with another task currently assigned to a node. If a computing node which sent out a task request determines that no conflict was identified, it can execute the task request. Communications within a loop can occur unidirectionally, such that a node which initiated a communication will receive the communication from the last loop node. Loops can be connected to form a ribbon, the ribbon providing a namespace for task execution, where hash ranges for the namespace are uniquely assigned to loops of the ribbon.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.