Lines Matching defs:tasks
66 * execute subtasks created by other active tasks (eventually blocking
68 * when most tasks spawn other subtasks (as do most {@code
71 * with event-style tasks that are never joined.
77 * internal worker threads, even if some tasks are stalled waiting to
97 * tasks that are already executing in a pool should normally
147 * <p>This implementation rejects submitted tasks (that is, by throwing
161 * into a submission queue. Workers take these tasks and typically
163 * Preference rules give first priority to processing tasks from
165 * randomized FIFO steals of tasks in other worker queues, and
169 * decentralized control -- workers mostly take tasks from
181 * bursts while submitted tasks begin or end. In some cases when
183 * (usually, scan for tasks) until contention subsides.
227 * let workers spin indefinitely scanning for tasks when none can
229 * there appear to be tasks available. On the other hand, we must
230 * quickly prod them into action when new tasks are submitted or
253 * task to a queue that previously had two or fewer tasks, they
258 * notices that there are more tasks too; together these cover the
259 * signals needed in cases when more than two tasks are pushed
279 * tasks on to a pool of workers, we can't just let them block (as
321 * "terminate" status, cancels all unprocessed tasks, and wakes up
342 * processing of billions of tasks per second, at the expense of
633 * previous step swept through all queues and found no tasks, or
723 // Scanning for tasks
730 * taking a submission only if no stealable tasks were found. The
735 * not only the task, but also all local tasks that this task may
1285 * queued workers; (1) helping cancel tasks; (2) interrupting
1286 * lagging threads (likely in external tasks, but possibly also
1445 * tasks. For default value, use {@code null}.
1448 * tasks that are never joined. This mode may be more appropriate
1450 * worker threads only process event-style asynchronous tasks.
1636 public <T> List<Future<T>> invokeAll(Collection<? extends Callable<T>> tasks) {
1638 new ArrayList<ForkJoinTask<T>>(tasks.size());
1639 for (Callable<T> task : tasks)
1649 final ArrayList<ForkJoinTask<T>> tasks;
1650 InvokeAll(ArrayList<ForkJoinTask<T>> tasks) { this.tasks = tasks; }
1652 try { invokeAll(tasks); }
1669 * due to unrecoverable errors encountered while executing tasks.
1700 * scheduling mode for forked tasks that are never joined.
1710 * not blocked waiting to join tasks or for other managed
1723 * stealing or executing tasks. This method may overestimate the
1749 * Returns an estimate of the total number of tasks stolen from
1764 * Returns an estimate of the total number of tasks currently held
1765 * in queues by worker threads (but not including tasks submitted
1771 * @return the number of queued tasks
1786 * Returns an estimate of the number of tasks submitted to this
1797 * Returns {@code true} if there are any tasks submitted to this
1830 * Removes all available unexecuted submitted and forked tasks
1833 * artificially generated or wrapped tasks. This method is
1836 * tasks. A failure encountered while attempting to add elements
1895 ", tasks = " + qt +
1902 * tasks are executed, but no new tasks will be accepted.
1919 * Attempts to cancel and/or stop all tasks, and reject all
1920 * subsequently submitted tasks. Tasks that are in the process of
1923 * both existing and unexecuted tasks, in order to permit
1942 * Returns {@code true} if all tasks have completed following shut down.
1944 * @return {@code true} if all tasks have completed following shut down
1956 * period after shutdown may indicate that submitted tasks have
1960 * tasks should not normally entail blocking operations. But if
1988 * Blocks until all tasks have completed execution after a shutdown
2017 * Interface for extending managed parallelism for tasks running