Scalable multi-threaded evaluation of vectorized data flow graphs
US10297053B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | May 10, 2016 |
| Grant date | May 21, 2019 |
| Priority date | — |
| Expiry date | Aug 11, 2036 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06T2210/52
- WIPO fieldAudio-visual technology
- WIPO sectorElectrical engineering
Abstract
Provided herein are methods, systems, and computer products for evaluating nodes concurrently using a modified data flow graph. The modified data flow graph can identify independent nodes that can run as separate tasks. However, rather than relying on declared dependencies, embodiments herein can determine dependencies between segments of data elements in a data flow graph, and modify the data flow graph to take advantage of the determined dependencies. In such embodiments, the data elements can be divided into segments. By separating data elements into segments, nodes that previously depended on each other can be evaluated concurrently when independent segments are identified.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.