quo;s strongly connected components algorithm</a> is adopted to discover the cyclic dependencies between regions and merge them into one pipelined region. It will traverse all the edges in the topology. For the all-to-all distribution pattern, the number of edges is O(n<sup>2</sup>). Thus, the computational complexity of this algorithm is O(n<sup>2</sup>), and it significantly slows down the initialization of the scheduler.</p>
<center>
<br/>
<img src="/img/blog/2022-01-05-scheduler-performance/5-scheduling