Lines Matching refs:tasks

18 1/nr_running speed.  For example: if there are 2 tasks running, then it runs
25 is its actual runtime normalized to the total number of running tasks.
35 [ small detail: on "ideal" hardware, at any time all tasks would have the same
36   p->se.vruntime value --- i.e., tasks would execute simultaneously and no task
42 up CPU time between runnable tasks as close to "ideal multitasking hardware" as
59 increasing value tracking the smallest vruntime among all tasks in the
64 The total number of running tasks in the runqueue is accounted through the
65 rq->cfs.load value, which is the sum of the weights of the tasks queued on the
68 CFS maintains a time-ordered rbtree, where all runnable tasks are sorted by the
70 As the system progresses forwards, the executed tasks are put into the tree
81 do not over-schedule tasks and trash the cache), then the new leftmost task is
120     policy that is used for regular tasks.
122   - SCHED_BATCH: Does not preempt nearly as often as regular tasks
123     would, thereby allowing tasks to run longer and make better use of
201 Normally, the scheduler operates on individual tasks and strives to provide
202 fair CPU time to each task.  Sometimes, it may be desirable to group tasks and
207 CONFIG_CGROUP_SCHED strives to achieve exactly that.  It lets tasks to be
211 SCHED_RR) tasks.
214 SCHED_BATCH) tasks.
217    create arbitrary groups of tasks, using the "cgroup" pseudo filesystem.  See
229 	# mkdir multimedia	# create "multimedia" group of tasks
230 	# mkdir browser		# create "browser" group of tasks
239 	# echo <firefox_pid> > browser/tasks
242 	# echo <movie_player_pid> > multimedia/tasks