edPartitionGroup.</p>
<center>
<br/>
<img src="/img/blog/2022-01-05-scheduler-performance/2-groups.svg" width="80%"/>
<br/>
Fig. 2 - How partitions and vertices are grouped w.r.t. distribution patterns
</center>
<br/>
<p>When scheduling tasks, Flink needs to iterate over all the connections between result partitions and consumer vertices. In the past, since there were O(n<sup>2</sup>) edges in total, the overall complexity of the iteration was O(n<sup>2</sup>). Now ExecutionEdge is replaced with ConsumerVer