Searched refs:numbers (Results 1 – 14 of 14) sorted by relevance
49 int numbers = argc > 1 ? strtol(argv[1], nullptr, 0) : 50; in main() local54 auto res = measure(fibonacci_two_tasks, numbers, ntrial); in main()58 res = measure(fibonacci_single_task, numbers, ntrial); in main()
2 This directory contains an example that computes Fibonacci numbers using emulation for TBB Task API.
2 This directory contains an example that computes Fibonacci numbers in several different ways.24 * `[M:N]` -a range of numbers of threads to be used.
6 | fibonacci | Compute Fibonacci numbers in different ways.
6 | square | Another string transformation example that squares numbers read from a file.
51 for the calculation of the Fibonacci numbers. Here is a graphical59 so the "lazy initialized" Fibonacci numbers are relevant here.
20 | parallel_pipeline/square | Another string transformation example that squares numbers read from a…26 | test_all/fibonacci | Compute Fibonacci numbers in different ways.
23 * `M:N` - range of numbers of threads to be used.
23 …or the default choice, and optional step expression specifies how thread numbers are chosen within…
36 …ple of a |short_name| algorithm. The sample calculates a sum of all integer numbers from 1 to 100. 87 …ple of a |short_name| algorithm. The sample calculates a sum of all integer numbers from 1 to 100.
46 …* `Compute Fibonacci numbers in different ways <https://github.com/oneapi-src/oneTBB/tree/master/e…
29 * `optimality` - controls optimality of solution; 1 is highest, use larger numbers for less optimal…
54 Data-parallel programming scales well to larger numbers of processors
17 …ared; this effect would eventually swamp the gain from comparing smaller numbers of polygons per s…