Invention Grant
- Patent Title: Methods of graph-type specialization and optimization in graph algorithm DSL compilation
-
Application No.: US15666310Application Date: 2017-08-01
-
Publication No.: US10585945B2Publication Date: 2020-03-10
- Inventor: Martin Sevenich , Sungpack Hong , Alexander Weld , Hassan Chafi , Martijn Dwars
- Applicant: Oracle International Corporation
- Applicant Address: US CA Redwood Shores
- Assignee: Oracle International Corporation
- Current Assignee: Oracle International Corporation
- Current Assignee Address: US CA Redwood Shores
- Agency: Hickman Palermo Becker Bingham LLP
- Agent Brian N. Miller
- Main IPC: G06F17/30
- IPC: G06F17/30 ; G06F16/901 ; G06F8/30 ; G06F8/41 ; G06F16/2453 ; G06F8/34

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.
Public/Granted literature
- US20190042661A1 Methods of Graph-Type Specialization and Optimization in Graph Algorithm DSL Compilation Public/Granted day:2019-02-07
Information query