Lines Matching refs:tasks

23 1/nr_running speed.  For example: if there are 2 tasks running, then it runs
30 is its actual runtime normalized to the total number of running tasks.
41    Small detail: on "ideal" hardware, at any time all tasks would have the same
42    p->se.vruntime value --- i.e., tasks would execute simultaneously and no task
48 up CPU time between runnable tasks as close to "ideal multitasking hardware" as
66 increasing value tracking the smallest vruntime among all tasks in the
71 The total number of running tasks in the runqueue is accounted through the
72 rq->cfs.load value, which is the sum of the weights of the tasks queued on the
75 CFS maintains a time-ordered rbtree, where all runnable tasks are sorted by the
77 As the system progresses forwards, the executed tasks are put into the tree
88 do not over-schedule tasks and trash the cache), then the new leftmost task is
132     policy that is used for regular tasks.
134   - SCHED_BATCH: Does not preempt nearly as often as regular tasks
135     would, thereby allowing tasks to run longer and make better use of
215 Normally, the scheduler operates on individual tasks and strives to provide
216 fair CPU time to each task.  Sometimes, it may be desirable to group tasks and
221 CONFIG_CGROUP_SCHED strives to achieve exactly that.  It lets tasks to be
225 SCHED_RR) tasks.
228 SCHED_BATCH) tasks.
231    create arbitrary groups of tasks, using the "cgroup" pseudo filesystem.  See
243 	# mkdir multimedia	# create "multimedia" group of tasks
244 	# mkdir browser		# create "browser" group of tasks
253 	# echo <firefox_pid> > browser/tasks
256 	# echo <movie_player_pid> > multimedia/tasks