Unsupervised round robin catch up algorithm
US10567499B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Dec 2, 2015 |
| Grant date | Feb 18, 2020 |
| Priority date | — |
| Expiry date | Dec 2, 2035 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L67/1097
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Data replication groups may be used to store data in a distributed computing environment. The data replication groups may include a set of nodes executing a consensus protocol to maintain data durably. During the execution of the set of nodes various nodes may become stale or otherwise obtain a state that is inconsistent with at least one other node of the data replication group. A catch up algorithm may be employed in which a set of teachers is initialized, the various node which may be stale may select a teacher from the set of teachers and perform learning operations. This process may be repeated until the state of the various nodes is current with at least one other node of the data replication group.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.