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
<p>Benchmarks showed Cpp-Taskflow can efficiently handle millions or billions of tasks (both large and small tasks) on a machine with up to 64 CPUs.</p>
120
113
<h2><aclass="anchor" id="GeneralQuestion5"></a>
121
114
Q5: What is the weird hex value, like 0x7fc39d402ab0, in the dumped graph?</h2>
122
-
<p>The hex value represents the memory address of the task. Each task has a method <aclass="el" href="classtf_1_1Task.html#a9057ecd0f3833b717480e914f8568f02" title="assigns a name to the task">tf::Task::name(const std::string&)</a> for user to assign a human readable string to ease the debugging process. If a task is not assigned a name or is an internal node, its address value in the memory is used instead.</p>
115
+
<p>The hex value represents the memory address of the task. Each task has a method <aclass="el" href="classtf_1_1Task.html#a9057ecd0f3833b717480e914f8568f02" title="assigns a name to the task">tf::Task::name(const std::string&)</a> for user to assign a human readable string to ease the debugging process. If a task is not assigned a name or is an internal node, its address value in the memory is used instead.</p>
123
116
<h2><aclass="anchor" id="GeneralQuestion6"></a>
124
117
Q6: Does Cpp-Taskflow have backward compatibility with C++03/11/14?</h2>
125
118
<p>Unfortunately, Cpp-Taskflow is heavily relying on modern C++17's features/idoms/STL and it is very difficult to provide a version that compiles under older C++ versions.</p>
126
119
<h2><aclass="anchor" id="GeneralQuestion7"></a>
127
120
Q7: How does Cpp-Taskflow schedule tasks?</h2>
128
-
<p>Cpp-Taskflow has implemented different scheduler modules (centralized queue, proactive shceduler, speculative strategy, and work stealing). The default scheduler implements the famous <ahref="https://en.wikipedia.org/wiki/Work_stealing">work stealing algorithm</a> that has shown to behave efficiently in most multicore architectures. You can find the source code at <code><aclass="el" href="workstealing__threadpool_8hpp_source.html">taskflow/threadpool/workstealing_threadpool.hpp</a></code></p>
129
-
<hr/>
121
+
<p>Cpp-Taskflow has implemented different scheduler modules (centralized queue, proactive shceduler, speculative strategy, and work stealing). The default scheduler implements the famous <ahref="https://en.wikipedia.org/wiki/Work_stealing">work stealing algorithm</a> that has shown to behave efficiently in most multicore architectures. You can find the source code at <code><aclass="el" href="workstealing__threadpool_8hpp_source.html">taskflow/threadpool/workstealing_threadpool.hpp</a></code></p><hr/>
Q4: My program hangs and never returns after dispatching a taskflow graph. What's wrong?</h2>
144
-
<p>When the program hangs forever it is very likely your taskflow graph has a cycle. Try the <aclass="el" href="classtf_1_1BasicTaskflow.html#adac448e1cc44307856b3116d7ed5490f" title="dumps the present task dependency graph to a std::ostream in DOT format">tf::Taskflow::dump</a> method to debug the graph before dispatching your taskflow graph.</p>
136
+
<p>When the program hangs forever it is very likely your taskflow graph has a cycle. Try the <aclass="el" href="classtf_1_1BasicTaskflow.html#adac448e1cc44307856b3116d7ed5490f" title="dumps the present task dependency graph to a std::ostream in DOT format">tf::Taskflow::dump</a> method to debug the graph before dispatching your taskflow graph.</p>
<p>No. The subflow is spawned during the execution of B, and at this point A must finish because A precedes B. This gives rise to the fact B1 and B2 must run after A. This graph may looks strange because B seems to run twice! However, Cpp-Taskflow will schedule B only once to create its subflow. Whether this subflow joins or detaches from B only affects the future object returned from B. </p>
151
-
</div></div><!-- PageDoc -->
152
-
</div><!-- contents -->
143
+
</div></div><!-- contents -->
153
144
</div><!-- doc-content -->
154
145
<!-- start footer part -->
155
146
<divid="nav-path" class="navpath"><!-- id is needed for treeview function! -->
0 commit comments