Method and system for merging directed acyclic graphs representing data flow codes
US8578389B1 · kind B1 · utility
Assignee
Inventor
Key dates
| Filing date | May 4, 2004 |
| Grant date | Nov 5, 2013 |
| Priority date | — |
| Expiry date | Jan 9, 2028 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F9/4494
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Methods and systems facilitating a programmer to program parts of a program in data flow programming to produce directed acyclic graphs (“DAGs”), and then merge the graphs at runtime for efficiency and scalability. Large merged DAG can typically be processed with greater efficiency than the collection of smaller DAGs. As a result, smaller DAGs may be created while the execution of the program realizes the increased efficiency of executing a larger DAG based on the merging of the smaller DAGs. In accordance with methods and systems consistent with the present invention, a programmer creates individual data flow directed acyclic graphs in a program.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.