[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <x49r4lvadvl.fsf@segfault.boston.devel.redhat.com>
Date: Tue, 08 Jan 2013 10:33:18 -0500
From: Jeff Moyer <jmoyer@...hat.com>
To: Kent Overstreet <koverstreet@...gle.com>
Cc: Jens Axboe <axboe@...nel.dk>, linux-kernel@...r.kernel.org,
linux-aio@...ck.org, linux-fsdevel@...r.kernel.org, zab@...hat.com,
bcrl@...ck.org, viro@...iv.linux.org.uk, tytso@....edu
Subject: Re: [PATCH 29/32] block, aio: Batch completion for bios/kiocbs
Kent Overstreet <koverstreet@...gle.com> writes:
>> Is the rbtree really faster than a basic (l)list and a sort before
>> completing them? Would be simpler.
>
> Well, depends. With one or two kioctxs? The list would definitely be
> faster, but I'm loathe to use an O(n^2) algorithm anywhere where the
> input size isn't strictly controlled, and I know of applications out
> there that use tons of kioctxs.
Out of curiosity, what applications do you know of that use tons of
kioctx's?
-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/
Powered by blists - more mailing lists