lkml.org 
[lkml]   [2003]   [Feb]   [10]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: stochastic fair queueing in the elevator [Re: [BENCHMARK] 2.

>> You can wait 10 minutes and still such command can't grow. This is why
>> claiming anticipatory scheduling can decrease the need for readahead
>> doesn't make much sense to me, there are important things you just can't
>> achieve by only waiting.
>>
>
> The anticipatory scheduler can easily permit 512k of reading before seeking
> away to another file. In fact it can allow much more, without requiring that
> readhead be cranked up.

IMHO anticipatory scheduling and readahead address different problems. RA is
simpler and cheaper. Reading a few more KB comes almost for free and that
helps a lot sequential reads. AS is useful for random i/o (fs metadata,
executables, ...), but it wastes time if the timer expires, or if the new
request wants data which is far away the previous one. AS is useful for
sequential reads too, but only if the application reads large chunks of
data, otherwise RA is better. I we need both RA and AS to address the
largest variety of workloads.

Bye.
-
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: 2005-03-22 13:33    [W:0.119 / U:2.688 seconds]
©2003-2018 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site