Runtime handling of task dependencies using dependence graphs
US9652286B2 · kind B2 · utility
Assignee
Inventor
Key dates
| Filing date | Mar 21, 2014 |
| Grant date | May 16, 2017 |
| Priority date | — |
| Expiry date | Mar 20, 2035 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F2209/484
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Embodiments include systems and methods for handling task dependencies in a runtime environment using dependence graphs. For example, a computer-implemented runtime engine includes runtime libraries configured to handle tasks and task dependencies. The task dependencies can be converted into data dependencies. At runtime, as the runtime engine encounters tasks and associated data dependencies, it can add those identified tasks as nodes of a dependence graph, and can add edges between the nodes that correspond to the data dependencies without deadlock. The runtime engine can schedule the tasks for execution according to a topological traversal of the dependence graph in a manner that preserves task dependencies substantially as defined by the source code.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.