Patent · US Active

Pruning compilation dependency graphs

US8978010B1 · kind B1 · utility

22Cited by

14References

19Claims

0Family size

Assignee

SAP AG · DE

Inventors

Andreas Thumfart · Heidelberg, DE
Norbert Kuck · Karlsruhe, DE

Key dates

Filing date	Dec 18, 2013
Grant date	Mar 10, 2015
Priority date	—
Expiry date	Dec 18, 2033

Classification

Technology area (CPC G)Physics
CPC primaryG06F8/36
WIPO fieldComputer technology
WIPO sectorElectrical engineering

Abstract

Technologies are disclosed for pruning a dependency graph representing source artifacts compilable by a plurality of compilers. The dependency graph can include strongly connected components represented as a directed acyclic graph. During compilation of the source artifacts, it can be discovered that some source artifacts did not need to be compiled, and associated nodes in the dependency graph can be pruned. Pruning can result in removal of nodes for source artifacts that are yet to be compiled, and compilation for source artifacts associated with such nodes in the dependency graph can be avoided.

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.