Messages in this thread | | | From | Jeff Moyer <> | Subject | Re: [PATCH 29/32] block, aio: Batch completion for bios/kiocbs | Date | Tue, 08 Jan 2013 10:33:18 -0500 |
| |
Kent Overstreet <koverstreet@google.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
| |