Dataflow graph programming environment for a heterogenous processing system

A host, comprising:

• one or more processors;
• a heterogeneous programming environment for defining a dataflow graph as object oriented source code;
• graph source code generated in the heterogeneous programming environment, the graph source code defining a plurality of kernels and a plurality of communication links, wherein each of the plurality of communication links couple a respective pair of the plurality of kernels to form the dataflow graph;
• and
• a compiler configured to compile the graph source code to implement the dataflow graph in a heterogeneous processing system, wherein compiling the graph source code comprises:
• assigning the plurality of kernels to the heterogeneous processing system based on constraints defined in the graph source code for the plurality of kernels, wherein the constraints are user-defined constraints that instruct the compiler to place a first kernel of the kernels in a first type of hardware element in the heterogeneous processing system and place a second kernel of the kernels in a second, different type of hardware element in the heterogeneous processing system,
• assigning a communication type to the plurality of communication links defined in the graph source code, and
• selecting synchronization techniques for transferring data between the plurality of kernels using the plurality of communication links,
• wherein the one or more processors are configured to configure the heterogeneous processing system to execute the dataflow graph using the compiled source code.

A method, comprising:

• providing a heterogeneous programming environment for defining a dataflow graph as object oriented source code;
• receiving graph source code generated in the heterogeneous programming environment, the graph source code defining a plurality of kernels and a plurality of communication links, wherein each of the plurality of communication links couple a respective pair of the plurality of kernels to form the dataflow graph;
• compiling the graph source code to implement the dataflow graph in a heterogeneous processing system using compiled source code, wherein compiling the graph source code comprises:
• assigning the plurality of kernels to the heterogeneous processing system based on a definition of the plurality of kernels in the graph source code, wherein assigning the plurality of kernels to the heterogeneous processing system comprises:
• identifying that a first kernel and a second kernel are communicatively coupled by a first one of the plurality of communication links as defined by the graph source code;
• assigning the first kernel to a first data processing engine (DPE) in the heterogeneous processing system;
• assigning the second kernel to programmable logic in the heterogeneous processing system;
• and
• configuring the second kernel to perform a direct memory access (DMA) using an interconnect to transfer data to the first kernel, wherein the interconnect interconnects an array of DPEs that includes the first DPE to each other and to programmable logic,
• assigning a communication type to the plurality of communication links defined in the graph source code, and
• selecting synchronization techniques for transferring data between the plurality of kernels using the plurality of communication links;
• and
• configuring the heterogeneous processing system to execute the dataflow graph using the compiled source code.