Visible to Intel only — GUID: GUID-4271DF77-897B-4D42-98D2-55F4149DD52E
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-4271DF77-897B-4D42-98D2-55F4149DD52E
Parallelizing Data Flow and Dependence Graphs
- Parallelizing Data Flow and Dependency Graphs
- Basic Flow Graph Concepts
- Graph Application Categories
- Predefined Node Types
- Flow Graph Tips and Tricks
- Estimating Flow Graph Performance