| /oneTBB/doc/main/tbb_userguide/ |
| H A D | Predefined_Node_Types.rst | 25 - A single-output node, with a generic output type.
29 …- A single-input single-output node that broadcasts its output to all successors. Has generic inpu…
31 …- A single-input, single-output node that broadcasts its output to all successors. It has a sin…
33 …- A single-input multi-output node. It has a generic input type and several generic output type…
35 …- A single-input, single-output node that broadcasts each message received to all successors. I…
37 …single-output nodes that buffer messages and send their output to one successor. The order in w…
39 …- A multi-input, single-output node. There are several generic input types and the output type …
41 …- A single-input, multi-output node. The input type is a tuple of generic types and there is on…
43 …- Single-input, single-output nodes that buffer a single message and broadcast their outputs to…
45 …- A multi-input, single output node that broadcasts its output to all successors. The main inpu…
[all …]
|
| H A D | Flow_Graph_Single_Vs_Broadcast.rst | 12 - **single-push**: No matter how many successors to the node exist and
53 // single-push policy
63 …printf( "after single-push test, g_cnt == %d, b1==%d, b2==%d, b3==%d\n", (int)g_cnt, (int)b1, (int…
89 after single-push test, g_cnt == 3, b1==3, b2==0, b3==0
93 The single-push test uses a ``buffer_node``, which has a "single-push"
107 a "single-push" policy; all other nodes have a "broadcast-push" policy.
|
| H A D | broadcast_or_send.rst | 8 their output to a single successor or broadcast to all successors. The
9 following predefined nodes push messages to a single successor:
21 The nodes that push to only a single successor are all buffer nodes.
133 successors, or just a single successor.
|
| H A D | Concurrent_Queue_Classes.rst | 13 The check and popping have to be done in a single operation for sake of
52 In a single-threaded program, a queue is a first-in first-out structure.
|
| H A D | use_concurrency_limits.rst | 7 To control the number of instances of a single node, you can use the
|
| H A D | Lock_Pathologies.rst | 40 holding a single lock.
|
| H A D | Memory_Allocation.rst | 16 might have to compete for a single shared pool in a way that allows
|
| H A D | More_on_HashCompare.rst | 45 The signatures go together in a single class because *if two keys are
|
| H A D | concurrent_vector_ug.rst | 52 single-threaded code. However, ``concurrent_vector`` does have more
|
| H A D | Advanced_Topic_Other_Kinds_of_Iteration_Spaces.rst | 75 equivalent, even on a single processor.
|
| H A D | How_Task_Scheduler_Works.rst | 16 - Preserve data locality to make a single thread execution more efficient
|
| H A D | use_input_node.rst | 108 it; that message would be dropped. Also, src has only a single
|
| H A D | Cancellation_and_Nested_Parallelism.rst | 20 single request.
|
| H A D | Mutual_Exclusion.rst | 19 that only a single thread has access to ``FreeList`` at a time.
|
| /oneTBB/examples/task_arena/fractal/ |
| H A D | main.cpp | 31 bool single = false; variable
59 .arg(single, "single", "process only one fractal")); in main()
80 fg.run(!single); in main()
|
| H A D | fractal_video.hpp | 25 extern bool single;
85 fg->run(!single); in on_process()
|
| H A D | README.md | 24 …of-iterations=value] [grain-size=value] [use-auto-partitioner] [silent] [single] [-h] [n-of-thread…
33 * `single` - process only one fractal.
|
| /oneTBB/doc/main/reference/ |
| H A D | make_edges_function.rst | 16 The ``make_edges`` function template creates edges between a single node
19 There are two ways to connect nodes in a set and a single node using
|
| /oneTBB/examples/concurrent_priority_queue/ |
| H A D | README.md | 6 | shortpath | Solves the single source shortest path problem using a `concurrent_priority_queue` c…
|
| /oneTBB/doc/main/tbb_userguide/design_patterns/ |
| H A D | Reference_Counting.rst | 48 decrement and test "count is zero?" must act as a single atomic
61 // Construct object with a single reference to it.
|
| H A D | Elementwise.rst | 54 the combination of the two patterns is accomplished in a single sweep
|
| /oneTBB/doc/GSG/ |
| H A D | intro.rst | 9 …parallel programming by breaking computation into parallel running tasks. Within a single process,
|
| /oneTBB/examples/concurrent_priority_queue/shortpath/ |
| H A D | README.md | 2 This directory contains an example that solves the single source shortest path problem.
|
| /oneTBB/examples/ |
| H A D | README.md | 8 | concurrent_priority_queue/shortpath | Solves the single source shortest path problem using a `co…
|
| /oneTBB/examples/graph/cholesky/ |
| H A D | README.md | 10 …mbine the inputs required for each call. So for example, there is only a single node that applies …
|