linux-kernel - Re: [PATCH] cfq-iosched: non-rot devices do not need read queue merging

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Message-ID: <x49fx6ladzk.fsf@segfault.boston.devel.redhat.com>
Date:	Mon, 04 Jan 2010 14:04:15 -0500
From:	Jeff Moyer <jmoyer@...hat.com>
To:	Vivek Goyal <vgoyal@...hat.com>
Cc:	Corrado Zoccolo <czoccolo@...il.com>,
	Jens Axboe <jens.axboe@...cle.com>,
	Linux-Kernel <linux-kernel@...r.kernel.org>,
	Shaohua Li <shaohua.li@...el.com>,
	Gui Jianfeng <guijianfeng@...fujitsu.com>
Subject: Re: [PATCH] cfq-iosched: non-rot devices do not need read queue merging

Vivek Goyal <vgoyal@...hat.com> writes:

> On Mon, Jan 04, 2010 at 07:37:17PM +0100, Corrado Zoccolo wrote:
>> On Mon, Jan 4, 2010 at 5:51 PM, Jeff Moyer <jmoyer@...hat.com> wrote:
>> > Corrado Zoccolo <czoccolo@...il.com> writes:
>> >
>> >> Hi Vivkek,
>> >>
>> >> On Mon, Jan 4, 2010 at 3:47 PM, Vivek Goyal <vgoyal@...hat.com> wrote:
>> >>> On Wed, Dec 30, 2009 at 11:22:47PM +0100, Corrado Zoccolo wrote:
>> >>>> Non rotational devices' performances are not affected by
>> >>>> distance of read requests, so there is no point in having
>> >>>> overhead to merge such queues.
>> >>>> This doesn't apply to writes, so this patch changes the
>> >>>> queued[] field, to be indexed by READ/WRITE instead of
>> >>>> SYNC/ASYNC, and only compute proximity for queues with
>> >>>> WRITE requests.
>> >>>>
>> >>>
>> >>> Hi Corrado,
>> >>>
>> >>> What's the reason that reads don't benefit from merging queues and hence
>> >>> merging requests and only writes do on SSD?
>> >>
>> >> On SSDs, reads are just limited by the maximum transfer rate, and
>> >> larger (i.e. merged) reads will just take proportionally longer.
>> >
>> > This is simply not true.  You can get more bandwidth from an SSD (I just
>> > checked numbers for 2 vendors' devices) by issuing larger read requests,
>> > no matter whether the access pattern is sequential or random.
>> I know, but the performance increase given the size is sublinear, and
>> the situation here is slightly different.
>> In order for the requests to be merged, they have to be submitted concurrently.
>> So you have to compare 2 concurrent requests of size x with one
>> request of size 2*x (with some CPU overhead).
>> Moreover, you always pay the CPU overhead, even if you can't do the
>> merging, and you must be very lucky to keep merging, because it means
>> the two processes are working in lockstep; it is not sufficient that
>> the requests are just nearby, as for rotational disks.
>> 
>
> For jeff, at least "dump" utility threads were kind of working in lockstep
> for writes and he gained significantly by merging these queues together.

Actually, it was for reads.

> So the argument is that CPU overhead saving in this case is more substantial
> as compared to gains made by lockstep read threads. I think we shall have to
> have some numbers to justify that.

Agreed.  Corrado, I know you don't have the hardware, so I'll give this
a run through the read-test2 program and see if it regresses at all.

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