Visible to Intel only — GUID: GUID-09491191-50D8-4636-B06B-6CB105A7919A
Package Contents
Parallelizing Simple Loops
Parallelizing Complex Loops
Parallelizing Data Flow and Dependence Graphs
Work Isolation
Exceptions and Cancellation
Containers
Mutual Exclusion
Timing
Memory Allocation
The Task Scheduler
Design Patterns
Migrating from Threading Building Blocks (TBB)
Constrained APIs
Invoke a Callable Object
Appendix A Costs of Time Slicing
Appendix B Mixing With Other Threading Packages
References
parallel_for_each Body semantics and requirements
parallel_sort ranges interface extension
TBB_malloc_replacement_log Function
Parallel Reduction for rvalues
Type-specified message keys for join_node
Scalable Memory Pools
Helper Functions for Expressing Graphs
concurrent_lru_cache
task_group extensions
The customizing mutex type for concurrent_hash_map
Visible to Intel only — GUID: GUID-09491191-50D8-4636-B06B-6CB105A7919A
Use graph::reset() to Reset a Canceled Graph
When a graph execution is canceled either because of an unhandled exception or because its task_group_context is canceled explicitly, the graph and its nodes may be left in an indeterminate state. For example, in the code samples shown in Cancel a Graph Explicitly the input 2 may be left in a buffer. But even beyond remnants in the buffers, there are other optimizations performed during the execution of a flow graph that can leave its nodes and edges in an indeterminate state. If you want to re-execute or restart a graph, you first need to reset the graph:
try {
g.wait_for_all();
} catch ( int j ) {
cout << "Caught " << j << "\n";
// do something to fix the problem
g.reset();
f1.try_put(1);
f1.try_put(2);
g.wait_for_all();
}