lover, and partition releasing. These procedures are all involved with traversing all consumer vertices for all the partitions. After the optimization, their overall computational complexity decreases from O(n<sup>2</sup>) to O(n).</p>
<h1 id="optimizations-related-to-task-deployment">
  Optimizations related to task deployment
  <a class="anchor" href="#optimizations-related-to-task-deployment">#</a>
</h1>
<h2 id="the-problem">
  The problem
  <a class="anchor" href="#the-problem">#</a>
</h2>
<p>In Flink 1