Lines Matching refs:is

22    Divide and conquer is widely used in serial algorithms. Common
36    -  Splitting problem or merging solutions is relatively cheap
64    Quicksort is a classic divide-and-conquer algorithm. It divides a
82    The number of subsorts is fixed at two, so ``oneapi::tbb::parallel_invoke``
83    provides a simple way to parallelize it. The parallel code is shown
101    Eventually the subsorts become small enough that serial execution is
121    The change is an instance of the Agglomeration pattern.
135    The problem is to find all nodes that collide with a target node. The
158    A parallel version is shown below.
191    The recursive walk is parallelized using class ``task_group`` to do
195    There is another significant change because of the parallelism that
196    is introduced. Because it would be unsafe to update ``Hits``
198    accumulate results. Because it is of type
208    If parallel overhead is high, use the agglomeration pattern. For
215    simple algorithm is used here to focus on exposition of the parallel