Home
last modified time | relevance | path

Searched refs:algorithm (Results 1 – 25 of 33) sorted by relevance

12

/oneTBB/doc/main/tbb_userguide/
H A DExceptions_and_Cancellation.rst8 cancellation. When code inside an oneTBB algorithm throws an exception,
13 algorithm are ignored.
16 #. The algorithm is cancelled. Pending iterations are not executed. If
21 #. Once all parts of the algorithm stop, an exception is thrown on the
22 thread that invoked the algorithm.
72 algorithm. When the exception happens, the algorithm is cancelled and an
H A DCancellation_and_Nested_Parallelism.rst12 An |full_name| algorithm executes
14 supply to the algorithm template. By default, these ``task`` objects are
15 associated with a ``task_group_context`` created by the algorithm.
19 Hence an algorithm and all algorithms it called can be cancelled with a
26 figure. Imagine that each node represents an algorithm and its
38 Suppose that the algorithm in C throws an exception and no node catches
85 To prevent downwards propagation of cancellation into an algorithm,
87 to the algorithm explicitly. The example uses C++11 lambda expressions for brevity.
H A DFloating_Point_Settings.rst30 …ms, including ``flow::graph``, to ensure that all tasks related to this algorithm use the specifie…
33 …cheduler initialization. It means, if a context is passed to a parallel algorithm, the floating-po…
36 In a nested call to a parallel algorithm that does not use the context of a task group with explici…
46 … call to a oneTBB parallel algorithm does not change the floating-point settings of the calling th…
H A DInitializing_and_Terminating_the_Library.rst8 for example any parallel algorithm, flow graph or task group.
18 or called inside a task, a parallel algorithm, or a flow graph node, the method fails.
H A Dstd_invoke.rst7 Previously, the body of the algorithm or Flow Graph node needed to be a Function Object (see `C++ S…
13 * **Pointers to member functions** that you can use as the body of the algorithm or the Flow Graph …
14 * **Pointers to member objects** work as the body of the algorithm or parallel construct
70 …ze a range in a parallel algorithm, such as ``parallel_for``, it was required to provide a ``Funct…
94 …with C++17, you can directly utilize a pointer to ``range.iterate()`` as the body of the algorithm:
H A DThe_Task_Scheduler.rst11 scheduler. However, if you have an algorithm that does not naturally map
H A DCancellation_Without_An_Exception.rst7 To cancel an algorithm but not throw an exception, use the expression ``current_context()->cancel_g…
H A DMutex_Flavors.rst52 algorithm will not scale anyway. Consider redesigning the algorithm
H A DControlling_Chunking_os.rst106 #. Run your algorithm.
110 algorithm slows down or speeds up as the value decreases.
/oneTBB/examples/graph/cholesky/
H A DREADME.md2 This directory contains an example of several versions of Cholesky Factorization algorithm.
6 **crout**: A serial implementation that uses the Crout-Cholesky algorithm for factorization. The sa…
27 …refix=value] [algorithm=value] [num_tbb_threads=value] [input_file=value] [-x] [-h] [size [blocksi…
32 * `num_trials` - the number of times to run each algorithm.
33 … <output_prefix>_posdef.txt and <output_prefix>_X.txt; where `X` is the algorithm used. If `output…
34 * `algorithm` - name of the used algorithm - can be dpotrf, crout, depend or join.
H A Dcholesky.cpp120 class algorithm { class
264 class algorithm_crout : public algorithm {
266 algorithm_crout() : algorithm("crout_cholesky", true) {} in algorithm_crout()
287 class algorithm_dpotrf : public algorithm {
289 algorithm_dpotrf() : algorithm("dpotrf_cholesky", false) {} in algorithm_dpotrf()
464 class algorithm_join : public algorithm {
540 class algorithm_depend : public algorithm {
542 algorithm_depend() : algorithm("depend_cholesky", true) {} in algorithm_depend()
674 typedef std::map<std::string, algorithm *> algmap_t; in main()
704 algorithm *const alg = i->second; in main()
[all …]
/oneTBB/examples/parallel_reduce/
H A DREADME.md2 Examples using `parallel_reduce` algorithm.
6 | convex_hull | Parallel version of convex hull algorithm (quick hull).
/oneTBB/examples/concurrent_priority_queue/shortpath/
H A DREADME.md4 …s and some random number of connections between those nodes. A parallel algorithm based on `A*` is…
6 This algorithm varies from serial `A*` in that it needs to add nodes back to the open set when the …
8 …s sorted) is not technically needed, so we could use this same parallel algorithm with just a `con…
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DDivide_and_Conquer.rst13 Parallelize a divide and conquer algorithm.
64 Quicksort is a classic divide-and-conquer algorithm. It divides a
214 recursion, and some other sorting algorithm for small subsorts. The
215 simple algorithm is used here to focus on exposition of the parallel
/oneTBB/examples/parallel_for_each/
H A DREADME.md2 Examples using `parallel_for_each` algorithm.
/oneTBB/examples/parallel_pipeline/
H A DREADME.md2 Examples using `parallel_pipeline` algorithm.
/oneTBB/examples/parallel_for/
H A DREADME.md2 Examples using `parallel_for` algorithm.
/oneTBB/doc/main/reference/
H A Dparallel_for_each_semantics.rst14 named requirements for ``tbb::parallel_for_each`` algorithm specification.
42 * ``iterator`` determines the type of the iterator passed into ``parallel_for_each`` algorithm (whi…
/oneTBB/examples/
H A DREADME.md10 | graph/cholesky | Several versions of Cholesky Factorization algorithm implementation.
21 | parallel_reduce/convex_hull | Parallel version of convex hull algorithm (quick hull).
/oneTBB/examples/graph/
H A DREADME.md7 | cholesky | Several versions of Cholesky Factorization algorithm implementation.
/oneTBB/examples/graph/fgbzip2/
H A DREADME.md26 * `-l` - use memory limit for compression algorithm with 1 MB (minimum) granularity.
/oneTBB/examples/parallel_reduce/convex_hull/
H A DREADME.md2 Parallel version of convex hull algorithm (quick hull).
/oneTBB/doc/GSG/
H A Dnext_steps.rst36 …#. Copy and paste the code below. It is a typical example of a |short_name| algorithm. The sample …
87 …#. Copy and paste the code below. It is a typical example of a |short_name| algorithm. The sample …
/oneTBB/examples/task_group/sudoku/
H A DREADME.md4 It uses a straightforward state-space search algorithm that exhibits OR-parallelism. It can be opti…
/oneTBB/examples/parallel_for/seismic/
H A DREADME.md27 * `serial` - in GUI mode start with serial version of algorithm.

12