lkml.org 
[lkml]   [2014]   [Oct]   [30]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [RFD PATCH 10/10] sched: io_latency: Tracking via buckets
On Thu, 30 Oct 2014, Peter Zijlstra wrote:

> On Wed, Oct 22, 2014 at 03:57:53PM +0200, Daniel Lezcano wrote:
> > The size of the bucket is the bucket interval and represent the resolution
> > of the statistic model. Eg with a bucket interval of 1us, it leads us to
> > do statitics on all numbers, with of course a bad prediction because the
> > number of latencies is big. A big interval can give better statistics,
> > but can give us a misprediction as the interval is larger.
> >
> > Choosing the size of the bucket interval vs the idle sleep time is the
> > tradeoff to find. With a 200us bucket interval, the measurements show
> > we still have good predictions, less mispredictions and cover the idle
> > state target residency.
> >
>
> For the record:
>
> The suggestion in DUS was to align the bucket sizes with the various
> break even times of the actual C states.
>
> I forgot who suggested this; it might have been Morten; but it seems to
> make sense.

I suggested that a while ago too. But IIRC Daniel envisioned some
possible additional use for those buckets in the future e.g.. a measure
of how many tasks can be packed on a CPU knowing their sleep periods.

However, if the IO latency can be predicted at the driver level with
good accuracy (it normally should) then there is no need to do any kind
of averaging and bucketing since the driver should be able to provide a
relatively precise number almost every time.


Nicolas


\
 
 \ /
  Last update: 2014-10-30 16:21    [W:0.075 / U:0.032 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site