Lines Matching refs:tasks

19 1/nr_running speed.  For example: if there are 2 tasks running, then it runs
26 is its actual runtime normalized to the total number of running tasks.
37    Small detail: on "ideal" hardware, at any time all tasks would have the same
38    p->se.vruntime value --- i.e., tasks would execute simultaneously and no task
44 up CPU time between runnable tasks as close to "ideal multitasking hardware" as
62 increasing value tracking the smallest vruntime among all tasks in the
67 The total number of running tasks in the runqueue is accounted through the
68 rq->cfs.load value, which is the sum of the weights of the tasks queued on the
71 CFS maintains a time-ordered rbtree, where all runnable tasks are sorted by the
73 As the system progresses forwards, the executed tasks are put into the tree
84 do not over-schedule tasks and trash the cache), then the new leftmost task is
125     policy that is used for regular tasks.
127   - SCHED_BATCH: Does not preempt nearly as often as regular tasks
128     would, thereby allowing tasks to run longer and make better use of
208 Normally, the scheduler operates on individual tasks and strives to provide
209 fair CPU time to each task.  Sometimes, it may be desirable to group tasks and
214 CONFIG_CGROUP_SCHED strives to achieve exactly that.  It lets tasks to be
218 SCHED_RR) tasks.
221 SCHED_BATCH) tasks.
224    create arbitrary groups of tasks, using the "cgroup" pseudo filesystem.  See
236 	# mkdir multimedia	# create "multimedia" group of tasks
237 	# mkdir browser		# create "browser" group of tasks
246 	# echo <firefox_pid> > browser/tasks
249 	# echo <movie_player_pid> > multimedia/tasks