| /oneTBB/test/conformance/ |
| H A D | conformance_parallel_for.cpp | 310 const std::size_t iterations = 100000; in test_pfor_body_invoke() local
313 std::vector<std::size_t> change_vector(iterations, 0); in test_pfor_body_invoke()
314 range_type range{0, iterations, change_vector}; in test_pfor_body_invoke()
331 const std::size_t iterations = 100000; in test_pfor_func_invoke() local
333 std::vector<std::size_t> change_vector(iterations, 0); in test_pfor_func_invoke()
335 SmartIndex last{iterations, change_vector}; in test_pfor_func_invoke()
357 for (std::size_t i = 1; i < iterations; ++i) { in test_pfor_func_invoke()
369 const std::size_t iterations = 100000; variable
371 oneapi::tbb::parallel_for(std::size_t(0), iterations, [&](std::size_t) { in __anondcc278fb0302()
375 oneapi::tbb::parallel_for(std::size_t(0), iterations, [&](std::size_t) { in __anondcc278fb0402()
[all …]
|
| H A D | conformance_parallel_scan.cpp | 154 const std::size_t iterations = 1000000; variable
155 std::vector<std::size_t> desired_vector(iterations);
157 for (std::size_t i = 1; i < iterations; ++i) {
161 std::vector<std::size_t> change_vector(iterations, 0);
162 test_invoke::SmartRange<test_invoke::SmartValue> range(0, iterations, change_vector);
|
| H A D | conformance_parallel_reduce.cpp | 139 const std::size_t iterations = 100000; in test_preduce_invoke_basic() local
140 const std::size_t result = iterations * (iterations - 1) / 2; in test_preduce_invoke_basic()
142 test_invoke::SmartRange<test_invoke::SmartValue> range(0, iterations); in test_preduce_invoke_basic()
|
| /oneTBB/examples/task_arena/fractal/ |
| H A D | README.md | 24 …ue] [max-of-iterations=value] [grain-size=value] [use-auto-partitioner] [silent] [single] [-h] [n-…
29 * `max-of-iterations` - the maximum number of the fractal iterations.
45 * `r` - increase quality (count of iterations for each pixel) the active fractal.
46 * `f` - decrease quality (count of iterations for each pixel) the active fractal.
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | Controlling_Chunking_os.rst | 18 ``grainsize`` is 1. It is in units of loop iterations per chunk.
44 iterations in a chunk. Using ``simple_partitioner`` guarantees that
55 may cause chunks to have more than G iterations, they never generate
56 chunks with less than [G/2] iterations. Specifying a range with an
88 Consider this relationship and not the total number of iterations or
92 A rule of thumb is that ``grainsize`` iterations of ``operator()``
95 least 1000 iterations. When in doubt, do the following experiment:
99 is specified in units of loop iterations. If you have no idea of how
115 iterations, the ``parallel_for`` distributes the loop across only two
|
| H A D | Partitioner_Summary.rst | 29 - Automatic chunk size, cache affinity and uniform distribution of iterations.
32 …- Deterministic chunk size, cache affinity and uniform distribution of iterations without loa…
44 iterations in nearly equal chunks between computing resources.
|
| H A D | Cancellation_and_Nested_Parallelism.rst | 82 other iterations.
121 propagates to the outer loop, any pending ``outer`` iterations are
122 cancelled, but not inner iterations for an outer iteration that started.
|
| H A D | Advanced_Example.rst | 30 loop iterations. To convert the loop to use ``parallel_reduce``, the
32 merge this information when iterations are spread across multiple
|
| H A D | Parallelizing_Simple_Loops_os.rst | 7 The simplest form of scalable parallelism is a loop of iterations that
|
| H A D | Bandwidth_and_Cache_Affinity_os.rst | 59 loop iterations. It remembers where iterations of the loop ran, so that
|
| H A D | work_isolation.rst | 33 parallel loop. As a result, two or more iterations of the outer loop
54 // While executing the above parallel_for, the thread might have run iterations
|
| H A D | Exceptions_and_Cancellation.rst | 16 #. The algorithm is cancelled. Pending iterations are not executed. If
|
| H A D | Cook_Until_Done_parallel_do.rst | 8 or the loop body may add more iterations to do before the loop exits.
|
| H A D | parallel_reduce.rst | 21 If the iterations are independent, you can parallelize this loop using
|
| /oneTBB/examples/parallel_for/game_of_life/ |
| H A D | README.md | 24 * `execution_time` - time (in sec) for execution `game_of_life` iterations.
|
| /oneTBB/examples/graph/som/ |
| H A D | README.md | 2 …s `oneapi::tbb::flow` and the use of cancellation in scheduling multiple iterations of map updates.
|