lkml.org 
[lkml]   [2007]   [May]   [14]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
Subjectfair clock use in CFS
Hi,
I have been brooding over how fair clock is computed/used in
CFS and thought I would ask the experts to avoid wrong guesses!

As I understand, fair_clock is a monotonously increasing clock which
advances at a pace inversely proportional to the load on the runqueue.
If load = 1 (task), it will advance at same pace as wall clock, as
load increases it advances slower than wall clock.

In addition, following calculations depend on fair clock: task's wait
time on runqueue and sleep time outside the runqueue (both reflected in
p->wait_run_time).

Few questions that come up are:

1. Why can't fair clock be same as wall clock at all times? i.e fair
clock progresses at same pace as wall clock independent of the load on
the runqueue.

It would still give the ability to measure time spent waiting on runqueue
or sleeping and use that calculated time to give latency/bandwidth
credit?

In case of EEVDF, the use of virtual clock seems more
understandable, if we consider the fact that each client gets 'wi' real
time units in 1 virtual time unit. That doesnt seem to be the case in
CFS as Ting Yang explained +/- lags here
http://lkml.org/lkml/2007/5/2/612 ..


2. Preemption granularity - sysctl_sched_granularity

This seems to be measured in the fair clock scale rather than
wall clock scale. As a consequence of this, the time taken
for a task to relinquish to competetion is dependent on number N
of tasks? For ex: if there a million cpu hungry tasks, then the
time taken to switch between two tasks is more compared to the
case where just two cpu hungry tasks are running. Is there
any advantage of using fair clock scale to detect preemtion points?


--
Regards,
vatsa
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/

\
 
 \ /
  Last update: 2007-05-14 10:29    [W:0.129 / U:0.012 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site