Traversing an adjacency list on distributed processors
US12360797B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jan 12, 2023 |
| Grant date | Jul 15, 2025 |
| Priority date | — |
| Expiry date | Jan 12, 2043 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F2009/45575
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A distributed system including multiple processors associated with non-transitory computer-readable media storing computing instructions. The computing instructions, when collectively executed on the multiple processors, cause the multiple processors collectively to perform certain acts. The acts can include executing multiple iterations until a stopping condition is satisfied, by, for each of the multiple iterations: (i) processing a set of input nodes at the multiple processors using a set of criteria to generate first data at the multiple processors, wherein the set of input nodes is different at each of the multiple iterations; (ii) determining a list of output nodes using adjacency rows of an adjacency list at different ones of the multiple processors, such that each output node of the list of output nodes is one hop from a respective input node of the set of the input nodes; and (iii) updating the set of the input nodes for a subsequent iteration of the multiple iterations based on the list of output nodes when the stopping condition is not satisfied. The acts also can include outputting second data based at least in part on the first data. Other embodiments are disclosed.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.