lkml.org 
[lkml]   [2008]   [Apr]   [17]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [RESEND][RFC] BFQ I/O Scheduler
> From: Aaron Carroll <aaronc@cse.unsw.edu.au>
> Date: Thu, Apr 17, 2008 08:24:09PM +1000
>
> Paolo Valente wrote:
> >In my opinion, the time-slice approach of cfq is definitely better
> >suited than the (sector) budget approach for this type of workloads. On
> >the opposite end, the price of time-slices is unfairness towards, e.g.,
> >threads doing sequential accesses. In bfq we were mainly thinking about
>
> How do you figure that? This is a situation where time-slices work nicely,
> because they implicitly account for the performance penalty of poor access
> patterns. The sequential-accessing processes (and the system overall) ends
> up with higher throughput.
>

The unfairness is not WRT tasks generating poor access patterns.
If you have two tasks doing sequential accesses on two different
regions of the disk the exact amount of service they receive in the
same amount of time depends on the transfer rate of the disk on
that regions, and, depending on the media, it is not always the same.

We showed some example of that in the original post and it is quite
easy to try it out if you put two partitions at the ends of a disk
and you try to read from them concurrently.


\
 
 \ /
  Last update: 2008-04-17 13:17    [W:0.087 / U:1.020 seconds]
©2003-2017 Jasper Spaans. hosted at Digital OceanAdvertise on this site