Visible to Intel only — GUID: GUID-A8F03235-CCA8-4039-92B0-2CB960DFA701
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
Waiting for Single Messages in Flow Graph
Visible to Intel only — GUID: GUID-A8F03235-CCA8-4039-92B0-2CB960DFA701
Graph Application Categories
Most flow graphs fall into one of two categories:
Data flow graphs. In this type of graph, data is passed along the graph’s edges. The nodes receive, transform and then pass along the data messages.
Dependence graphs. In this type of graph, the data operated on by the nodes is obtained through shared memory directly and is not passed along the edges.