Home
last modified time | relevance | path

Searched refs:slice (Results 1 – 6 of 6) sorted by relevance

/oneTBB/doc/main/tbb_userguide/
H A Dappendix_A.rst8 threads. Each logical thread is serviced for a *time slice* by a
9 physical thread. If a thread runs longer than a time slice, as most do,
26 not a cache primer.) When a logical thread gets its time slice, as it
31 Time slicing undoes this, because if a thread A finishes its time slice,
34 data. When thread A gets its next time slice, it will need to reload
36 worse yet, the next time slice for thread A may be on a different
41 lock on a resource, and its time slice runs out before it releases the
44 turn at a time slice to come up. Any other threads waiting on the lock
45 either pointlessly busy-wait, or lose the rest of their time slice. The
H A DParallelizing_Flow_Graph.rst76 graph. For example, you must "Put jelly on 1 slice" **before** you "Put
88 the peanut butter might be spread on one slice of bread in parallel with
89 the jelly being spread on the other slice. The interface expresses what
H A DWorking_on_the_Assembly_Line_pipeline.rst67 // Holds a slice of text.
280 crossing into the next slice, it copies the partial numeral to the next
281 slice. Furthermore, it has to indicate when the end of input is reached.
312 // Read characters into space that is available in the next slice.
328 // If so, transfer characters of partial number to next slice.
/oneTBB/examples/parallel_reduce/pi/
H A Dmain.cpp40 for (number_t slice = 0; slice < last; slice += chunk_size) { in compute_pi_serial() local
41 ret += pi_slice_kernel(slice); in compute_pi_serial()
H A Dcommon.h36 inline double pi_slice_kernel(number_t slice, number_t slice_size = chunk_size) {
38 for (number_t i = slice; i < slice + slice_size; ++i) {
/oneTBB/examples/parallel_pipeline/square/
H A DREADME.md19 …ile=value] [output-file=value] [max-slice-size=value] [silent] [-h] [n-of-threads [input-file [out…
25 * `max-slice-size` - the maximum number of characters in one slice.