Hi, Thanks for the nice animation and the work put into this.
I was wondering if the subgraph partitions for the same compiler (at this level) have any repercussions for downstream passes. So for example assume that the last node of A1(called a1) is a Conv2d and the first of A3 (called a3) is an elemwise add. Further assume that the "blue" compiler has a 'very fast' implementation of a Add(Tensor,Conv2d(Tensor)). This means that actually moving a1 into the A3 subgraph is a better option. I guess this is similar to the previous concerns regarding the "optimal" subgraph partitioning, but without 'many' compilers. Since there is still only the "red" and "blue" --- [Visit Topic](https://discuss.tvm.ai/t/relay-improved-graph-partitioning-algorithm/5830/17) to respond. You are receiving this because you enabled mailing list mode. To unsubscribe from these emails, [click here](https://discuss.tvm.ai/email/unsubscribe/e6b3ee18897be3fb50f5f32fff0df65a2f909e318644c01c340353ede0c40974).
