Lines Matching refs:time

33 timestamp and measure the "expected CPU time" a task should have gotten.
35 [ small detail: on "ideal" hardware, at any time all tasks would have the same
37   would ever get "out of balance" from the "ideal" share of CPU time.  ]
42 up CPU time between runnable tasks as close to "ideal multitasking hardware" as
54 runqueues, but it uses a time-ordered rbtree to build a "timeline" of future
68 CFS maintains a time-ordered rbtree, where all runnable tasks are sorted by the
73 amount of time.
77 for": the (small) time it just spent using the physical CPU is added to
79 becomes the "leftmost task" of the time-ordered rbtree it maintains (plus a
193    This function is mostly called from time tick functions; it might lead to
202 fair CPU time to each task.  Sometimes, it may be desirable to group tasks and
203 provide fair CPU time to each such task group.  For example, it may be
204 desirable to first provide fair CPU time to each user on the system and then to
208 grouped and divides CPU time fairly among such groups.
210 CONFIG_RT_GROUP_SCHED permits to group real-time (i.e., SCHED_FIFO and