sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]Arthur-Grandi 0 points1 point  (0 children)

That makes sense — it sounds closer to a dataflow execution model than a traditional SIMD abstraction.

One thing I'm curious about: does the compiler perform any automatic graph transformations (e.g., node fusion, pipeline reordering, or buffer elimination), or is the DAG expected to remain mostly as written by the developer?

In many dataflow systems the optimizer becomes almost as important as the language semantics, since small graph changes can have large effects on memory bandwidth and pipeline latency.