ity of the algorithm will be O(n).</p>
<center>
<br/>
<img src="/img/blog/2022-01-05-scheduler-performance/6-building-pipelined-region.svg" width="90%"/>
<br/>
Fig. 6 - How to convert a LogicalPipelinedRegion to ScheduledPipelinedRegions
</center>
<br/>
<p>After the optimization, the overall computational complexity of building pipelined regions decreases from O(n<sup>2</sup>) to O(n). In our experiments, for the job which contains two vertices connected with a blocking all-to-all edge, when their paralleli