Overview - 2024.1 English

AI Engine-ML Kernel and Graph Programming Guide (UG1603)

Document ID
UG1603
Release Date
2024-06-06
Version
2024.1 English

Graphs can be programmed in a variety of topologies depending on the needs of your application. You can take advantage the flexibility of C++ to describe the graph topologies. Graphs can be embedded into other graphs as sub-graphs and this can be repeated many times, limited only by the performance of the machine on which you compile. Multiple graphs can be connected sequentially or in parallel, connecting themselves to simple kernels or I/Os.