Methods of graph-type specialization and optimization in graph algorithm DSL compilation
US10585945B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Aug 1, 2017 |
| Grant date | Mar 10, 2020 |
| Priority date | — |
| Expiry date | Mar 1, 2038 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/2453
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Techniques herein generate, such as during compilation, polymorphic dispatch logic (PDL) to switch between specialized implementations of a polymorphic graph algorithm. In an embodiment, a computer detects, within source logic of a graph algorithm, that the algorithm processes an instance of a generic graph type. The computer generates several alternative implementations of the algorithm. Each implementation is specialized to process the graph instance as an instance of a respective graph subtype. The computer generates PDL that performs dynamic dispatch as follows. At runtime, the PDL receives a graph instance of the generic graph type. The PDL detects which particular graph subtype is the graph instance. The PDL then invokes whichever alternative implementation that is specialized to process the graph instance as an instance of the detected particular graph subtype. In embodiments, the source logic is expressed in a domain specific language (DSL), e.g. for analysis, traversal, or querying of graphs.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.