| /oneTBB/doc/main/tbb_userguide/ |
| H A D | Nodes.rst | 11 one input message or generate more than one output message.
20 represents a simple function with one input and one output. The
146 The library spawns three tasks, each one applying n's lambda expression
147 to one of the messages. If you have a sufficient number of threads
149 occur in parallel. If however, you have only one thread in the system,
|
| H A D | Lock_Pathologies.rst | 17 Deadlock happens when threads are trying to acquire more than one
25 - Each thread holds at least one lock on a mutex, and is waiting on
45 acquire a lock on one of each, you could always acquire the "outer
46 sanctum" one first. Another example is "acquire locks in
|
| H A D | Memory_Allocation.rst | 17 only one thread to allocate at a time.
28 caches. If one processor modifies a cache line and another processor
29 reads the same cache line, the line must be moved from one processor
55 cost in space, because it must allocate at least one cache line’s
|
| H A D | Guiding_Task_Scheduler_Execution.rst | 38 may cause a performance penalty if threads from one NUMA node access the memory allocated on
81 .. rubric:: Limiting the maximum number of threads simultaneously scheduled to one core
84 allow more than one thread to run on each core simultaneously. However, there might be situations
88 The example shows how to allow only one thread to run on each core at a time:
111 number of available cores. However, this one results in fewer overheads and better composability
|
| H A D | Reader_Writer_Mutexes.rst | 7 Mutual exclusion is necessary when at least one thread *writes* to a
11 *reader locks* from *writer locks.* There can be more than one reader
|
| H A D | Mapping_Nodes2Tasks.rst | 7 The following figure shows the timeline for one possible execution of
10 three calls to try_put spawn three tasks; each one applies the lambda
11 expression, λ\ :sub:`n`, on one of the three input messages. Because n
|
| H A D | Predefined_Node_Types.rst | 29 …ntrollable concurrency level and buffering policy. For each input exactly one output is returned.
37 …- Single-input, single-output nodes that buffer messages and send their output to one successor…
39 …and the output type is a tuple of these generic types. The node combines one message from each i…
41 …ti-output node. The input type is a tuple of generic types and there is one output port for eac…
47 … of generic types and the output type is a tagged_msg. The message is of one of the types list…
|
| H A D | attach_flow_graph_to_arena.rst | 15 This example shows how to set the most performant core type as the preferred one
30 core type as the preferred one for a work execution. Whenever a task is spawned on behalf
|
| H A D | Mutex_Flavors.rst | 9 generality and efficiency. Picking the right one often helps
15 this is not an accurate name, because a mutex limits execution to one
16 thread at a time. A *scalable mutex* is one that does not do *worse*
89 to take a Mutex type parameter. The parameter can be one of the real
|
| H A D | Containers.rst | 16 mutex to make them safe for concurrent access, by letting only one
22 via one or both of the following methods:
|
| H A D | use_concurrency_limits.rst | 12 A function node is constructed with one or more template arguments. The
77 simultaneously, three in the ``function_node`` and one buffered in the
|
| H A D | Task-Based_Programming.rst | 34 when there is exactly one running logical thread per physical thread.
42 one logical thread per physical thread, and mapping tasks to logical
87 threads to get good efficiency, because you have one logical thread per
|
| H A D | broadcast_or_send.rst | 84 nodes push each message to only one successor. And, you can use this
85 characteristic to create useful graph structures such as the one shown
92 creating one priority_queue_node for each function_node, and pushing
|
| H A D | Graph_Main_Categories.rst | 7 Most flow graphs fall into one of two categories:
|
| H A D | The_Task_Scheduler.rst | 12 onto one of the high-level templates, use the task scheduler.
|
| H A D | Scalable_Memory_Allocator.rst | 8 consists of two dynamic shared libraries, one with
|
| H A D | Data_Flow_Graph.rst | 72 - one to square values
73 - one to cube values
74 - one to add values to the global sum
|
| H A D | Flow_Graph_Single_Vs_Broadcast.rst | 13 are able to accept a message, each message will be only sent to one
97 for which node is pushed to if more than one successor can accept.
|
| H A D | create_token_based_system.rst | 29 The buffer policy can be one of the following:
51 The ``input_node`` will only generate an input when one is pulled from it
113 the graph. There could be three big objects in the ``function_node`` and one
|
| /oneTBB/examples/parallel_for/polygon_overlay/ |
| H A D | README.md | 8 * The naive parallel solution, by splitting list of polygons from one map and intersecting each sub…
9 …one submap). To prevent multiple copies of a polygon from being placed in the solution map, if bot…
11 …rea of the generated sub-polygons are subtracted from the original area of one of the source polyg…
23 One further optimization would be to sort one map, say map1, by maxY, and sort the other map (map2)…
25 … polygons, then `N` "boxes" are chosen at random, then one-at-a-time the areas are expanded in one…
|
| /oneTBB/doc/main/intro/ |
| H A D | notation.rst | 29 …- Braces and vertical bars indicate the choice of one item from a selection of two or more …
36 … - \ ``filename`` ... Indicates that one or more filenames can be specified.
39 …- \ ``word`` ,... Indicates that one or more words can be specified. If more than on…
|
| /oneTBB/src/tbb/ |
| H A D | task_stream.h | 54 const population_t one = 1; variable
59 dest.fetch_or( one<<pos ); in set_one_bit()
65 dest.fetch_and( ~(one<<pos) ); in clear_one_bit()
71 return (val & (one<<pos)) != 0; in is_bit_set()
|
| /oneTBB/doc/main/reference/ |
| H A D | task_group_extensions.rst | 66 … the function must be created using ``*this`` ``task_group``. That is, the one for which the run m…
73 … the function must be created using ``*this`` ``task_group``. That is, the one for which the run m…
81 …function must be created with ``*this`` ``task_group``. It means, with the one for which run metho…
|
| /oneTBB/examples/task_group/sudoku/ |
| H A D | README.md | 21 sudoku [n-of-threads=value] [filename=value] [verbose] [silent] [find-one] [-h] [n-of-threads [file…
28 * `find-one` - stops after finding first solution.
|
| /oneTBB/integration/windows/env/ |
| H A D | vars.bat | 20 REM ^<arch^> should be one of the following
24 REM ^<vs^> should be one of the following
|