| [ Web Proxy ] |
| Viewing: https://raw.githubusercontent.com/ModuleWorks/taskflow/task_isolation/docs/SubflowTasking.html | [Back] [Original] |
It is very common for a parallel program to spawn task dependency graphs at runtime. In Taskflow, we call this subflow tasking.
Subflow tasks are those created during the execution of a graph. These tasks are spawned from a parent task and are grouped together to a subflow dependency graph. To create a subflow, emplace a callable that takes an argument of type tf::Subflow. A tf::Subflow object will be created and forwarded to the execution context of the task. All methods you find in tf::Taskflow are applicable for tf::Subflow.
1: tf::Taskflow taskflow; 2: tf::Executor executor; 3: 4: tf::Task A = taskflow.emplace([] () {}).name("A"); // static task A 5: tf::Task C = taskflow.emplace([] () {}).name("C"); // static task C 6: tf::Task D = taskflow.emplace([] () {}).name("D"); // static task D 7: 8: tf::Task B = taskflow.emplace([] (tf::Subflow& subflow) { 9: tf::Task B1 = subflow.emplace([] () {}).name("B1"); // subflow task B1 10: tf::Task B2 = subflow.emplace([] () {}).name("B2"); // subflow task B2 11: tf::Task B3 = subflow.emplace([] () {}).name("B3"); // subflow task B3 12: B1.precede(B3); // B1 runs before B3 13: B2.precede(B3); // B2 runs before B3 14: }).name("B"); 15: 16: A.precede(B); // B runs after A 17: A.precede(C); // C runs after A 18: B.precede(D); // D runs after B 19: C.precede(D); // D runs after C 20: 21: executor.run(taskflow).get(); // execute the graph to spawn the subflow
Debrief:
Lines 8-14 are the main block to enable subflow tasking at task B. The runtime will create a tf::Subflow 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.
By default, a tf::Subflow automatically clears its internal task graph once it is joined. After a subflow joins, its structure and associated resources are no longer accessible. This behavior is designed to reduce memory usage, particularly in applications that recursively spawn many subflows. For applications that require post-processing, such as visualizing the subflow through tf::Taskflow::dump, users can disable this default cleanup behavior by calling tf::Subflow::retain_on_join on true. This instructs the runtime to retain the subflow's task graph even after it has joined, enabling further inspection or visualization.
tf::Taskflow taskflow; tf::Executor executor; taskflow.emplace([&](tf::Subflow& sf){ sf.retain_on_join(true); // retain the subflow after join for visualization auto A = sf.emplace([](){ std::cout << "A\n"; }); auto B = sf.emplace([](){ std::cout << "B\n"; }); auto C = sf.emplace([](){ std::cout << "C\n"; }); A.precede(B, C); // A runs before B and C }); // subflow implicitly joins here executor.run(taskflow).wait(); // The subflow graph is now retained and can be visualized using taskflow.dump(...) taskflow.dump(std::cout);
By default, a subflow implicitly joins its parent task when execution leaves its context. All terminal nodes (i.e., nodes with no outgoing edges) in the subflow are guaranteed to precede the parent task. Upon joining, the subflow's task graph and associated resources are automatically cleaned up. If your application needs to access variables defined within the subflow after it joins, you can explicitly join the subflow and handle post-processing accordingly. A common use case is parallelizing recursive computations such as the Fibonacci sequence:
int spawn(int n, tf::Subflow& sbf) { if (n < 2) return n; int res1, res2; sbf.emplace([&res1, n] (tf::Subflow& sbf) { res1 = spawn(n - 1, sbf); } ); sbf.emplace([&res2, n] (tf::Subflow& sbf) { res2 = spawn(n - 2, sbf); } ); sbf.join(); // join to materialize the subflow immediately return res1 + res2; } taskflow.emplace([&res] (tf::Subflow& sbf) { res = spawn(5, sbf); }); executor.run(taskflow).wait();
The code above computes the fifth Fibonacci number using recursive subflow. Calling tf::Subflow::join immediately materializes the subflow by executing all associated tasks to recursively compute Fibonacci numbers. The taskflow graph is shown below:
A subflow can be nested or recursive. You can create another subflow from the execution of a subflow and so on.
1: tf::Taskflow taskflow; 2: 3: tf::Task A = taskflow.emplace([] (tf::Subflow& sf){ 4: std::cout << "A spawns A1 & subflow A2\n"; 5: tf::Task A1 = sf.emplace([] () { 6: std::cout << "subtask A1\n"; 7: }).name("A1"); 8: 9: tf::Task A2 = sf.emplace([] (tf::Subflow& sf2){ 10: std::cout << "A2 spawns A2_1 & A2_2\n"; 11: tf::Task A2_1 = sf2.emplace([] () { 12: std::cout << "subtask A2_1\n"; 13: }).name("A2_1"); 14: tf::Task A2_2 = sf2.emplace([] () { 15: std::cout << "subtask A2_2\n"; 16: }).name("A2_2"); 17: A2_1.precede(A2_2); 18: }).name("A2"); 19: A1.precede(A2); 20: }).name("A"); 21: 22: // execute the graph to spawn the subflow 23: tf::Executor().run(taskflow).get();
Debrief:
In order to properly visualize subflows, you need to call tf::Subflow::retain_on_join and run the taskflow once to spawn its associated subflows.
Search for symbols, directories, files, pages or
modules. You can omit any prefix from the symbol or file path; adding a
: or / suffix lists all members of given symbol or
directory.
Use ↓ / ↑ to navigate through the list, Enter to go. Tab autocompletes common prefix, you can copy a link to the result using L while M produces a Markdown link.
Taskflow handbook is part of the Taskflow project, copyright Dr. Tsung-Wei Huang, 2018–2025.
Generated by Doxygen 1.12.0 and m.css.
| Web Proxy Viewer | New URL | Original Page |