EXTRACTING STREAM GRAPH STRUCTURE IN A COMPUTER LANGUAGE BY PRE-EXECUTING A DETERMINISTIC SUBSET

摘要

Compile-time recognition of graph structure where graph has arbitrary connectivity and is constructed using recursive computations is provided. In one aspect, the graph structure recognized at compile time may be duplicated at runtime and can then operate on runtime values not known at compile time.

主权项

1. A system for extracting a stream graph for a hardware circuit from a program written in a programming language, comprising:
a processor; a programming language compiler operable to execute on the processor and further operable to analyze a program for one or more constructs in the programming language that builds the stream graph for programming the hardware circuit, a node in the stream graph representing a computation to be performed, the computation expressed in the programming language, an edge in the stream graph representing data flowing from the node to another node in the stream graph, the programming language compiler further operable to output one or more artifacts representing the stream graph, wherein the stream graph can be compiled for the hardware circuit to execute and produce a result with different node initialization values and different streaming data values that are presented in an execution of the program not known at compile time, and wherein the stream graph can be built using iterative computation and the connectivity of the stream graph can be arbitrary.