| /oneTBB/doc/main/tbb_userguide/ |
| H A D | Which_Dynamic_Libraries_to_Use.rst | 8 scalable memory allocator library as
15 use the scalable allocator library if it is present otherwise it reverts
17 in applications that choose to omit the scalable memory allocator
22 with or without the oneTBB scalable memory allocator library.
35 … - |full_name| scalable memory allocator library. See **Scalable Memory Allocator**.
39 …- Uses the scalable allocator library if it is present, otherwise it reverts to using ``mal…
|
| H A D | Mutex_Flavors.rst | 14 - **Scalable**. Some mutexes are called *scalable*. In a strict sense,
16 thread at a time. A *scalable mutex* is one that does not do *worse*
20 Scalable mutexes are often slower than non-scalable mutexes under
21 light contention, so a non-scalable mutex may be better. When in
22 doubt, use a scalable mutex.
46 - ``spin_mutex`` is non-scalable, unfair, non-recursive, and spins in
61 - ``queuing_mutex`` is scalable, fair, non-recursive, and spins in user
80 mutexes are *scalable* when work with low conflict rate, i.e. mostly
|
| H A D | Scalable_Memory_Allocator.rst | 9 general support and the other with a scalable memory allocator. The
13 or only the scalable memory allocator, or both. See the links below for
|
| H A D | automatically-replacing-malloc.rst | 9 (such as ``malloc``) with the |full_name| scalable equivalents.
15 scalable memory allocator library should be taken from the same release
|
| H A D | Summary_of_Loops_and_Pipelines.rst | 7 give you efficient scalable ways to exploit the power of multi-core chips without having to start f…
|
| H A D | Parallelizing_Simple_Loops_os.rst | 7 The simplest form of scalable parallelism is a loop of iterations that
|
| H A D | Linux_C_Dynamic_Memory_Interface_Replacement.rst | 41 scalable memory allocator library at program load time. For that you may
|
| H A D | Windows_C_Dynamic_Memory_Interface_Replacement.rst | 67 scalable memory allocator library at program load time. For that you may
|
| H A D | Memory_Allocation.rst | 61 The scalable memory allocator also provides a set of functions
|
| H A D | Parallelizing_Flow_Graph.rst | 8 It's possible to create graphs that are highly scalable, but it is also possible to
|
| /oneTBB/doc/main/intro/ |
| H A D | intro_os.rst | 7 |full_name| is a library that supports scalable parallel programming using
9 compilers. It is designed to promote scalable data parallel programming.
|
| H A D | Benefits.rst | 48 - **oneTBB emphasizes scalable, data parallel programming**. Breaking a
|
| /oneTBB/include/oneapi/tbb/ |
| H A D | tbb_allocator.h | 51 scalable, enumerator
70 return r1::is_tbbmalloc_used() ? standard : scalable; in allocator_type()
|
| /oneTBB/doc/main/reference/scalable_memory_pools/ |
| H A D | memory_pool_cls.rst | 9 A class template for scalable memory allocation from memory blocks provided by an underlying alloca…
25 If the underlying allocator refers to another scalable memory pool, the inner pool (or pools)
|
| H A D | fixed_pool_cls.rst | 9 A class for scalable memory allocation from a buffer of fixed size.
|
| /oneTBB/test/conformance/ |
| H A D | conformance_allocators.cpp | 76 …bool is_available_type = (a_type == Allocator::malloc_type::scalable) || (a_type == Allocator::sta…
|
| /oneTBB/doc/main/reference/ |
| H A D | scalable_memory_pools.rst | 10 thread-safe, scalable operations. The following table summarizes the Memory Pool named requirement.
|
| /oneTBB/doc/GSG/ |
| H A D | intro.rst | 19 Use oneTBB to write scalable applications that:
|
| /oneTBB/ |
| H A D | README.md | 15 * oneTBB emphasizes scalable, data parallel programming.
|
| /oneTBB/doc/main/tbb_userguide/design_patterns/ |
| H A D | Non-Preemptive_Priorities.rst | 175 ``ReadyPileType``. Ideally scalable concurrent containers should be
|
| /oneTBB/examples/parallel_for/polygon_overlay/ |
| H A D | README.md | 54 * `--use_malloc` - allocate polygons with malloc instead of scalable allocator.
|