Visible to Intel only — GUID: GUID-CC632306-958B-435A-A125-C2AAB94228BA
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-CC632306-958B-435A-A125-C2AAB94228BA
Using Circular Buffers
Circular buffers can sometimes be used to minimize the overhead of allocating and freeing the items passed between pipeline filters. If the first filter to create an item and last filter to consume an item are both serial_in_order, the items can be allocated and freed via a circular buffer of size at least ntoken, where ntoken is the first parameter to parallel_pipeline. Under these conditions, no checking of whether an item is still in use is necessary.
The reason this works is that at most ntoken items can be in flight, and items will be freed in the order that they were allocated. Hence by the time the circular buffer wraps around to reallocate an item, the item must have been freed from its previous use in the pipeline. If the first and last filter are notserial_in_order, then you have to keep track of which buffers are currently in use, because buffers might not be retired in the same order they were allocated.