Messages in this thread |  | | Date | Tue, 8 Jan 2013 08:06:54 -0800 | From | Kent Overstreet <> | Subject | Re: [PATCH 29/32] block, aio: Batch completion for bios/kiocbs |
| |
On Tue, Jan 08, 2013 at 10:33:18AM -0500, Jeff Moyer wrote: > 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?
"tons" is relative I suppose, but before this patch series sharing a kioctx between threads was really bad for performance and... you know how people can be with threads.
|  |