You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.
Dismiss alert
<li><ahref="#CreateASubflow">Create a Subflow</a></li>
<li><ahref="#JoinASubflow">Join a Subflow</a></li>
<li><ahref="#DetachASubflow">Detach a Subflow</a></li>
<li><ahref="#MakeANestedSubflow">Make a Nested Subflow</a></li>
</ul>
</div>
<p>It is very common for a parallel program to spawn task dependency graphs at runtime. In Taskflow, we call this <em>dynamic tasking</em>.</p><sectionid="CreateASubflow"><h2><ahref="#CreateASubflow">Create a Subflow</a></h2><p>Dynamic tasks are those created during the execution of a graph. These tasks are spawned from a parent task and are grouped together to a <em>subflow</em> dependency graph. Taskflow has an unified interface for static and dynamic tasking. To create a subflow, emplace a callable that takes an argument of type <ahref="classtf_1_1Subflow.html" class="m-doc">tf::<wbr/>Subflow</a>. A <ahref="classtf_1_1Subflow.html" class="m-doc">tf::<wbr/>Subflow</a> object will be created and forwarded to the execution context of the task. All methods you find in <ahref="classtf_1_1Taskflow.html" class="m-doc">tf::<wbr/>Taskflow</a> are applicable for <ahref="classtf_1_1Subflow.html" class="m-doc">tf::<wbr/>Subflow</a>.</p><preclass="m-code"><spanclass="mi">1</span><spanclass="o">:</span><spanclass="n">tf</span><spanclass="o">::</span><spanclass="n">Taskflow</span><spanclass="n">taskflow</span><spanclass="p">;</span>
<spanclass="mi">13</span><spanclass="o">:</span><spanclass="n">B2</span><spanclass="p">.</span><spanclass="n">precede</span><spanclass="p">(</span><spanclass="n">B3</span><spanclass="p">);</span><spanclass="c1">// B2 runs before B3</span>
<spanclass="mi">16</span><spanclass="o">:</span><spanclass="n">A</span><spanclass="p">.</span><spanclass="n">precede</span><spanclass="p">(</span><spanclass="n">B</span><spanclass="p">);</span><spanclass="c1">// B runs after A</span>
<spanclass="mi">17</span><spanclass="o">:</span><spanclass="n">A</span><spanclass="p">.</span><spanclass="n">precede</span><spanclass="p">(</span><spanclass="n">C</span><spanclass="p">);</span><spanclass="c1">// C runs after A</span>
<spanclass="mi">18</span><spanclass="o">:</span><spanclass="n">B</span><spanclass="p">.</span><spanclass="n">precede</span><spanclass="p">(</span><spanclass="n">D</span><spanclass="p">);</span><spanclass="c1">// D runs after B</span>
<spanclass="mi">19</span><spanclass="o">:</span><spanclass="n">C</span><spanclass="p">.</span><spanclass="n">precede</span><spanclass="p">(</span><spanclass="n">D</span><spanclass="p">);</span><spanclass="c1">// D runs after C</span>
<spanclass="mi">20</span><spanclass="o">:</span>
<spanclass="mi">21</span><spanclass="o">:</span><spanclass="n">executor</span><spanclass="p">.</span><spanclass="n">run</span><spanclass="p">(</span><spanclass="n">taskflow</span><spanclass="p">).</span><spanclass="n">get</span><spanclass="p">();</span><spanclass="c1">// execute the graph to spawn the subflow</span>
<spanclass="mi">22</span><spanclass="o">:</span><spanclass="n">taskflow</span><spanclass="p">.</span><spanclass="n">dump</span><spanclass="p">(</span><spanclass="n">std</span><spanclass="o">::</span><spanclass="n">cout</span><spanclass="p">);</span><spanclass="c1">// dump the taskflow to a DOT format</span></pre><div><divclass="m-graph"><svgstyle="width: 23.250rem; height: 15.188rem;" viewBox="0.00 0.00 372.00 243.00">
</div></div><p>Debrief:</p><ul><li>Lines 1-2 create a taskflow and an executor</li><li>Lines 4-6 create three tasks, A, C, and D</li><li>Lines 8-14 create a task B that spawns a task dependency graph of three tasks B1, B2, and B3</li><li>Lines 16-19 add dependencies among A, B, C, and D</li><li>Line 21 submits the graph to an executor and waits until it finishes</li><li>Line 22 dumps the entire task dependency graph</li></ul><p>Lines 8-14 are the main block to enable dynamic tasking. Taskflow uses a <ahref="https://en.cppreference.com/w/cpp/utility/variant">std::<wbr/>variant</a> date type to unify the interface of static tasking and dynamic tasking. The runtime will create a <ahref="classtf_1_1Subflow.html" class="m-doc">tf::<wbr/>Subflow</a> passing it to task B, and spawn a dependency graph as described by the associated callable. This new subflow graph will be added to the topology of its parent task B. Due to the property of dynamic tasking, we cannot dump its structure before execution. We will need to run the graph first to spawn the graph and then call <ahref="classtf_1_1Taskflow.html#ac433018262e44b12c4cc9f0c4748d758" class="m-doc">tf::<wbr/>Taskflow::<wbr/>dump</a>.</p></section><sectionid="JoinASubflow"><h2><ahref="#JoinASubflow">Join a Subflow</a></h2><p>By default, a subflow joins its parent task when the program leaves its execution context. All nodes of zero outgoing edges in the subflow precede its parent task. You can explicitly join a subflow within its execution context to carry out recursive patterns. A famous implementation is fibonacci recursion.</p><preclass="m-code"><spanclass="kt">int</span><spanclass="nf">spawn</span><spanclass="p">(</span><spanclass="kt">int</span><spanclass="n">n</span><spanclass="p">,</span><spanclass="n">tf</span><spanclass="o">::</span><spanclass="n">Subflow</span><spanclass="o">&</span><spanclass="n">sbf</span><spanclass="p">)</span><spanclass="p">{</span>
<spanclass="n">sbf</span><spanclass="p">.</span><spanclass="n">join</span><spanclass="p">();</span><spanclass="c1">// join to materialize the subflow immediately</span>
<spanclass="n">executor</span><spanclass="p">.</span><spanclass="n">run</span><spanclass="p">(</span><spanclass="n">taskflow</span><spanclass="p">).</span><spanclass="n">wait</span><spanclass="p">();</span></pre><p>The code above computes the fifth fibonacci number using recursive subflow. Calling <ahref="classtf_1_1Subflow.html#a59fcac1323e70d920088dd37bd0be245" class="m-doc">tf::<wbr/>Subflow::<wbr/>join</a><em>immediately</em> materializes the subflow by executing all associated tasks to recursively compute fibonacci numbers. The taskflow graph is shown below:</p><divclass="m-graph"><svgstyle="width: 41.875rem; height: 36.125rem;" viewBox="0.00 0.00 670.00 577.85">
</div><p>Our implementation to join subflows is <em>recursive</em> in order to preserve the thread context in each subflow task. Having a deep recursion of subflows may cause stack overflow.</p></section><sectionid="DetachASubflow"><h2><ahref="#DetachASubflow">Detach a Subflow</a></h2><p>In contract to joined subflow, you can detach a subflow from its parent task, allowing its execution to flow independently.</p><preclass="m-code"><spanclass="mi">1</span><spanclass="o">:</span><spanclass="n">tf</span><spanclass="o">::</span><spanclass="n">Taskflow</span><spanclass="n">taskflow</span><spanclass="p">;</span>
<spanclass="mi">12</span><spanclass="o">:</span><spanclass="n">B2</span><spanclass="p">.</span><spanclass="n">precede</span><spanclass="p">(</span><spanclass="n">B3</span><spanclass="p">);</span><spanclass="c1">// B2 runs before B3</span>
<spanclass="mi">13</span><spanclass="o">:</span><spanclass="n">subflow</span><spanclass="p">.</span><spanclass="n">detach</span><spanclass="p">();</span><spanclass="c1">// detach this subflow</span>
<spanclass="mi">16</span><spanclass="o">:</span><spanclass="n">A</span><spanclass="p">.</span><spanclass="n">precede</span><spanclass="p">(</span><spanclass="n">B</span><spanclass="p">);</span><spanclass="c1">// B runs after A</span>
<spanclass="mi">17</span><spanclass="o">:</span><spanclass="n">A</span><spanclass="p">.</span><spanclass="n">precede</span><spanclass="p">(</span><spanclass="n">C</span><spanclass="p">);</span><spanclass="c1">// C runs after A</span>
<spanclass="mi">18</span><spanclass="o">:</span><spanclass="n">B</span><spanclass="p">.</span><spanclass="n">precede</span><spanclass="p">(</span><spanclass="n">D</span><spanclass="p">);</span><spanclass="c1">// D runs after B</span>
<spanclass="mi">19</span><spanclass="o">:</span><spanclass="n">C</span><spanclass="p">.</span><spanclass="n">precede</span><spanclass="p">(</span><spanclass="n">D</span><spanclass="p">);</span><spanclass="c1">// D runs after C</span>
<spanclass="mi">22</span><spanclass="o">:</span><spanclass="n">executor</span><spanclass="p">.</span><spanclass="n">run</span><spanclass="p">(</span><spanclass="n">taskflow</span><spanclass="p">).</span><spanclass="n">wait</span><spanclass="p">();</span><spanclass="c1">// execute the graph to spawn the subflow</span>
<spanclass="mi">22</span><spanclass="o">:</span><spanclass="n">taskflow</span><spanclass="p">.</span><spanclass="n">dump</span><spanclass="p">(</span><spanclass="n">std</span><spanclass="o">::</span><spanclass="n">cout</span><spanclass="p">);</span><spanclass="c1">// dump the taskflow to DOT format</span></pre><p>The figure below demonstrates a detached subflow based on the previous example. A detached subflow will eventually join the topology of its parent task.</p><divclass="m-graph"><svgstyle="width: 19.750rem; height: 17.625rem;" viewBox="0.00 0.00 316.00 282.31">
</div><p>Detached subflow becomes an independent graph attached to the top-most taskflow. Running a taskflow multiple times will accumulate all detached tasks in the graph. For example, running the above taskflow 5 times results in a total of 19 tasks.</p><preclass="m-code"><spanclass="n">executor</span><spanclass="p">.</span><spanclass="n">run_n</span><spanclass="p">(</span><spanclass="n">taskflow</span><spanclass="p">,</span><spanclass="mi">5</span><spanclass="p">).</span><spanclass="n">wait</span><spanclass="p">();</span>
</div></section><sectionid="MakeANestedSubflow"><h2><ahref="#MakeANestedSubflow">Make a Nested Subflow</a></h2><p>A subflow can be nested or recursive. You can create another subflow from the execution of a subflow and so on.</p><preclass="m-code"><spanclass="mi">1</span><spanclass="o">:</span><spanclass="n">tf</span><spanclass="o">::</span><spanclass="n">Taskflow</span><spanclass="n">taskflow</span><spanclass="p">;</span>
<spanclass="mi">10</span><spanclass="o">:</span><spanclass="n">std</span><spanclass="o">::</span><spanclass="n">cout</span><spanclass="o"><<</span><spanclass="s">"A2 spawns A2_1 & A2_2</span><spanclass="se">\n</span><spanclass="s">"</span><spanclass="p">;</span>
</div><p>Debrief:</p><ul><li>Line 1 creates a taskflow object</li><li>Lines 3-20 create a task to spawn a subflow of two tasks A1 and A2</li><li>Lines 9-18 spawn another subflow of two tasks A2_1 and A2_2 out of its parent task A2</li><li>Lines 23-24 runs the graph asynchronously and dump its structure when it finishes</li></ul><p>Similarly, you can detach a nested subflow from its parent subflow. A detached subflow will run independently and eventually join the topology of its parent subflow.</p></section>
</div>
</div>
</div>
</article></main>
<divclass="m-doc-search" id="search">
<ahref="#!" onclick="return hideSearch()"></a>
<divclass="m-container">
<divclass="m-row">
<divclass="m-col-m-8 m-push-m-2">
<divclass="m-doc-search-header m-text m-small">
<div><spanclass="m-label m-default">Tab</span> / <spanclass="m-label m-default">T</span> to search, <spanclass="m-label m-default">Esc</span> to close</div>