Kent Overstreet <[email protected]> writes: > On Tue, Jan 08, 2013 at 10:33:18AM -0500, Jeff Moyer wrote: >> Kent Overstreet <[email protected]> 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.
I wasn't questioning the merits of the patch, I was simply curious to know how aio is being (ab)used in the wild. So, is this some internal tool, then, or what? Thanks! Jeff -- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to [email protected] More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
