Visible to Intel only — GUID: GUID-6C0BBCDE-7B77-453B-A61B-94E5D93F3F1F
Package Contents
Parallelizing Simple Loops
Parallelizing Complex Loops
Parallelizing Data Flow and Dependence Graphs
Work Isolation
Exceptions and Cancellation
Floating-point Settings
Containers
Mutual Exclusion
Timing
Memory Allocation
The Task Scheduler
Design Patterns
Migrating from Threading Building Blocks (TBB)
Constrained APIs
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
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-6C0BBCDE-7B77-453B-A61B-94E5D93F3F1F
Flow Graph Tips for Exception Handling and Cancellation
The execution of a flow graph can be canceled directly or as a result of an exception that propagates beyond a node’s body. You can then optionally reset the graph so that it can be re-executed.