| /oneTBB/examples/parallel_reduce/primes/ |
| H A D | README.md | 18 primes [n-of-threads=value] [number=value] [grain-size=value] [n-of-repeats=value] [silent] [-h] [n… 21 …number of threads to use; a range of the form low\[:high\], where low and optional high are non-ne… 22 * `number` - the upper bound of range to search primes in, must be a positive integer. 24 * `n-of-repeats` - the number of the calculation repeats, must be a positive integer.
|
| H A D | main.cpp | 62 NumberType number = 100000000; in ParseCommandLine() local 71 .positional_arg(number, in ParseCommandLine() 81 RunOptions options(threads, grainSize, number, silent, repeatNumber); in ParseCommandLine()
|
| /oneTBB/examples/parallel_for/polygon_overlay/ |
| H A D | README.md | 14 * the number of threads used, and 15 * the fact that for each submap, the number of polygons is smaller than that for the other two case… 17 …number of intersections calculated is approximately 80,000 (400 * 200, where 200 is the average nu… 19 Running the default release pover while varying the number of submaps from 1 to 1000, the speedup o… 25 …as possible in each case. So the actual number of polygons in each map will in general be larger t… 27 One limitation of the program is that if the number of polygons in the source map is greater than t… 48 * `threads[:threads2]` - number of threads to run. 49 * `--polys npolys` - number of polygons in each map. 51 * `--seed nnn` - initial value of random number generator.
|
| /oneTBB/examples/task_group/sudoku/ |
| H A D | README.md | 24 …number of threads to use; a range of the form low\[:high\], where low and optional high are non-ne… 31 `input1` - Sample input file with modest number of solutions. 32 `input2` - Sample input file with small number of solutions. 33 `input3` - Sample input file with larger number of solutions. 34 `input4` - Sample input file with very large number of solutions.
|
| /oneTBB/examples/concurrent_hash_map/count_strings/ |
| H A D | README.md | 2 The example counts the number of unique words in a text. 21 …number of threads to use; a range of the form low\[:high\], where low and optional high are non-ne… 22 * `n-of-strings` - number of strings.
|
| /oneTBB/examples/graph/som/ |
| H A D | README.md | 22 …[radius-fraction=value] [number-of-epochs=value] [cancel-test] [debug] [nospeculate] [-h] [n-of-th… 25 * `n-of-threads` - number of threads to use; a range of the form low\[:high\], where low and option… 27 * `number-of-epochs` - number of examples used in learning phase.
|
| /oneTBB/examples/parallel_reduce/pi/ |
| H A D | README.md | 22 …number of threads to use. This number is specified in the low\[:high\] range format, where both ``… 23 * `n-of-intervals` - the number of intervals to subdivide into. Must be a positive integer.
|
| /oneTBB/examples/graph/binpack/ |
| H A D | README.md | 2 …ample that performs binpacking of `N` integer values into a near-optimal number of bins of capacit… 23 …number of threads to use; a range of the form low\[:high\] where low and optional high are non-neg… 26 * `N` - number of values to pack. 28 * `#packers` - number of concurrent bin packers to use (`default=#threads`).
|
| /oneTBB/doc/main/tbb_userguide/Migration_Guide/ |
| H A D | Task_Scheduler_Init.rst | 10 Managing the number of threads 13 Querying the default number of threads 22 …returns the maximum number of threads available for the parallel algorithms within the current con… 38 limits the total number of oneTBB worker threads 53 // Get the default number of threads 58 // Assert the maximum number of threads 66 // Assert the maximum number of threads 94 // Limit the number of threads to two for all oneTBB parallel interfaces
|
| /oneTBB/examples/concurrent_priority_queue/shortpath/ |
| H A D | README.md | 4 …meterized by `N`, a number of nodes, and a start and end node in `[0..N)`. A graph is generated wi… 31 …number of threads to use; a range of the form low[:high], where low and optional high are non-nega… 34 * `N` - number of nodes in graph.
|
| /oneTBB/examples/parallel_for_each/parallel_preorder/ |
| H A D | README.md | 9 …eld `ref_count` that is an atomic integer. Initialize `ref_count` to the number of inputs for the … 41 …number of threads to use; a range of the form low\[:high\], where low and optional high are non-ne… 42 * `n-of-nodes` - the number of nodes in the graph. Default value is 1000. 43 * `n-of-traversals` - the number of times to evaluate the graph. Default value is 500.
|
| /oneTBB/examples/parallel_pipeline/square/ |
| H A D | README.md | 22 …number of threads to use; a range of the form low\[:high\], where low and optional high are non-ne… 25 * `max-slice-size` - the maximum number of characters in one slice.
|
| /oneTBB/examples/parallel_reduce/convex_hull/ |
| H A D | README.md | 27 …number of threads to use; a range of the form low\[:high\], where low and optional high are non-ne… 28 * `n-of-points` - number of points.
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | Flow_Graph_resource_tips.rst | 7 You may want to control the number of messages allowed to enter parts of 8 your graph, or control the maximum number of tasks in the work pool.
|
| H A D | Guiding_Task_Scheduler_Execution.rst | 25 - The maximum number of logical threads scheduled per single core simultaneously 81 .. rubric:: Limiting the maximum number of threads simultaneously scheduled to one core 85 when there is need to lower the number of simultaneously running threads per core. In such cases, 97 A more composable way to limit the number of threads executing on cores is by setting the maximal 110 Similarly to the previous example, the number of threads inside the arena is equal to the 111 number of available cores. However, this one results in fewer overheads and better composability
|
| H A D | std_invoke.rst | 132 int number; 140 return obj.number; 165 …ody to be a Function Object. A lambda function was required to extract the number from the Object. 167 With C++17, you can use ``std::invoke`` with a pointer to the member number directly as the body. 174 int number; 186 // Use a member function pointer to the number member of the Object struct as the body 187 function_node<Object, int> func1(g, unlimited, &Object::number);
|
| /oneTBB/examples/task_arena/fractal/ |
| H A D | README.md | 27 …number of threads to use; a range of the form low\[:high\], where low and optional high are non-ne… 28 * `n-of-frames` - the number of frames the example processes internally. 29 * `max-of-iterations` - the maximum number of the fractal iterations.
|
| /oneTBB/examples/migration/recursive_fibonacci/ |
| H A D | README.md | 20 * `N` - specifies the fibonacci number which would be calculated. 22 * `I` - number of iteration to measure benchmark time.
|
| H A D | fibonacci.cpp | 29 int number, in measure() argument 36 result = f(number); in measure()
|
| H A D | CMakeLists.txt | 33 # `N` - specifies the fibonacci number which would be calculated. 35 # `I` - number of iteration to measure benchmark time.
|
| /oneTBB/examples/parallel_for/seismic/ |
| H A D | README.md | 24 …number of threads to use; a range of the form low\[:high\], where low and optional high are non-ne… 25 * `n-of-frames` - number of frames the example processes internally.
|
| /oneTBB/examples/graph/logic_sim/ |
| H A D | README.md | 21 …number of threads to use; a range of the form low[:high] where low and optional high are non-negat…
|
| /oneTBB/examples/test_all/fibonacci/ |
| H A D | README.md | 23 * `K` - specifies the fibonacci number which would be calculated. 25 * `R` - the number of times to repeat the calculation.
|
| /oneTBB/test/conformance/ |
| H A D | conformance_collaborative_call_once.cpp | 63 oneapi::tbb::collaborative_call_once(once_flag, [](int number) { in __anon8e61f74e0102() argument 65 REQUIRE(number == 0); in __anon8e61f74e0102()
|
| /oneTBB/doc/main/tbb_userguide/design_patterns/ |
| H A D | Wavefront.rst | 35 - The number of immediate predecessors in the graph is known in 48 counter with each item. Initialize each counter to the number of 56 If the number of predecessors for an item cannot be determined in 57 advance, treat the information "know number of predecessors" as an 58 additional predecessor. When the number of predecessors becomes
|