From mboxrd@z Thu Jan 1 00:00:00 1970 From: Jeff Moyer Subject: Re: [PATCH 29/32] block, aio: Batch completion for bios/kiocbs Date: Tue, 08 Jan 2013 10:33:18 -0500 Message-ID: References: <1356573611-18590-1-git-send-email-koverstreet@google.com> <1356573611-18590-32-git-send-email-koverstreet@google.com> <50E69F5B.8060902@kernel.dk> <20130107233443.GG26407@google.com> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Cc: Jens Axboe , linux-kernel@vger.kernel.org, linux-aio@kvack.org, linux-fsdevel@vger.kernel.org, zab@redhat.com, bcrl@kvack.org, viro@zeniv.linux.org.uk, tytso@mit.edu To: Kent Overstreet Return-path: In-Reply-To: <20130107233443.GG26407@google.com> (Kent Overstreet's message of "Mon, 7 Jan 2013 15:34:43 -0800") Sender: owner-linux-aio@kvack.org List-Id: linux-fsdevel.vger.kernel.org Kent Overstreet 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, send a message with 'unsubscribe linux-aio' in the body to majordomo@kvack.org. For more info on Linux AIO, see: http://www.kvack.org/aio/ Don't email: aart@kvack.org