Lines Matching refs:task

7 While the task scheduler is not bound to any particular type of parallelism, 
12 Let's consider the mapping of fork-join parallelism on the task scheduler in more detail. 
20 must be reached. Assuming that the task graph is finite, depth-first is better for 
27 - **Minimize space**. Execution of the shallowest task leads to the breadth-first unfolding of a gr…
33 thread spawns a task, it pushes it onto the bottom of its deque.
36 a task obtained by the first rule that applies from the roughly equivalent ruleset:
38 - Get the task returned by the previous one, if any.
40 - Take a task from the bottom of its deque, if any.
42 - Steal a task from the top of another randomly chosen deque. If the 
46 The overall effect of rule 2 is to execute the *youngest* task spawned by the thread, 
48 Then rule 3 applies. It steals the *oldest* task spawned by another thread,