Visible to Intel only — GUID: GUID-99465290-24BD-4A05-BA06-7CF91FAEC906
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-99465290-24BD-4A05-BA06-7CF91FAEC906
Memory Allocation
oneAPI Threading Building Blocks (oneTBB) provides several memory allocator templates that are similar to the STL template class std::allocator. Two templates, scalable_allocator<T> and cache_aligned_allocator<T>, address critical issues in parallel programming as follows:
Scalability. Problems of scalability arise when using memory allocators originally designed for serial programs, on threads that might have to compete for a single shared pool in a way that allows only one thread to allocate at a time.
Use the scalable_allocator<T> template to avoid scalability bottlenecks. This template can improve the performance of programs that rapidly allocate and free memory.
False sharing. Problems of sharing arise when two threads access different words that share the same cache line. The problem is that a cache line is the unit of information interchange between processor caches. If one processor modifies a cache line and another processor reads the same cache line, the line must be moved from one processor to the other, even if the two processors are dealing with different words within the line. False sharing can hurt performance because cache lines can take hundreds of clocks to move.
Use the cache_aligned_allocator<T> template to always allocate on a separate cache line. Two objects allocated by cache_aligned_allocator are guaranteed to not have false sharing. However, if an object is allocated by cache_aligned_allocator and another object is allocated some other way, there is no guarantee.
You can use these allocator templates as the allocator argument to STL template classes.The following code shows how to declare an STL vector that uses cache_aligned_allocatorfor allocation:
std::vector<int,cache_aligned_allocator<int> >;
TIP:
The functionality of cache_aligned_allocator<T> comes at some cost in space, because it must allocate at least one cache line’s worth of memory, even for a small object. So use cache_aligned_allocator<T> only if false sharing is likely to be a real problem.
The scalable memory allocator also provides a set of functions equivalent to the C standard library memory management routines but has the scalable_ prefix in their names, as well as the way to easily redirect the standard routines to these functions.